diff options
| -rw-r--r-- | main.c | 22 |
1 files changed, 19 insertions, 3 deletions
| @@ -76,6 +76,20 @@ void insert(vector_t *vec, int index, int val){ | |||
| 76 | vec->cur_size += 1; | 76 | vec->cur_size += 1; |
| 77 | } | 77 | } |
| 78 | 78 | ||
| 79 | void delete(vector_t *vec, int index){ | ||
| 80 | if (!(index < vec->cur_size)){ | ||
| 81 | printf("Invalid Index!\nFailed to Delete Element\n"); | ||
| 82 | exit(-1); | ||
| 83 | } | ||
| 84 | int len = vec->cur_size - 1; | ||
| 85 | |||
| 86 | for (int i = index; i < len; i++){ | ||
| 87 | vec->arr[i] = vec->arr[i+1]; | ||
| 88 | } | ||
| 89 | |||
| 90 | vec->cur_size = vec->cur_size - 1; | ||
| 91 | } | ||
| 92 | |||
| 79 | void prepend(vector_t *vec, int value){ | 93 | void prepend(vector_t *vec, int value){ |
| 80 | insert(vec, 0, value); | 94 | insert(vec, 0, value); |
| 81 | } | 95 | } |
| @@ -113,10 +127,12 @@ int main(void){ | |||
| 113 | for (int i = 0; i < vec.max_size; i++){ | 127 | for (int i = 0; i < vec.max_size; i++){ |
| 114 | push(&vec, i); | 128 | push(&vec, i); |
| 115 | } | 129 | } |
| 130 | print_vec(vec); | ||
| 116 | 131 | ||
| 117 | for (int i = 0; i < vec.max_size; i++){ | 132 | /* for (int i = 0; i < vec.max_size; i++){ */ |
| 118 | printf("pop: %d\n", pop(&vec)); | 133 | /* printf("pop: %d\n", pop(&vec)); */ |
| 119 | } | 134 | /* delete(&vec, 0); */ |
| 135 | /* } */ | ||
| 120 | 136 | ||
| 121 | printf("The size of the vector is %d.\n", size(vec)); | 137 | printf("The size of the vector is %d.\n", size(vec)); |
| 122 | printf("The first element of the vector is %d.\n", at(vec, 0)); | 138 | printf("The first element of the vector is %d.\n", at(vec, 0)); |
