陕西师范大学《C语言程序设计》第四章链表.pptxVIP

第四章 链表; resizable array; ? mechanism of resizable array of int. ? Growable ? Get the current size ? Access to the elements; ? Array array_create(int init_size); ? void array_free(Array *a); ? int array_size(const Array *a); ? int* array_at(Array *a, int index); ? void array_in?ate(Array *a, int more_size);; typedef struct { int *array; int size; } Array;; array_create() Array array_create(int init_size) { Array a; a.array = (int*)malloc(sizeof(int)*init_size);; void array_free(Array *a) { free(a-array); a-size = 0; }; array_size(); array_at() int* array_at(Array *a, int index) { if ( index = a-size ) { array_in?ate(a, index-a-size); } return (a-array[index] hyint* not int?; Array a = array_create(10); *(array_at(a, 5)) = 6; *(array_at(a, 10)) = *(array_at(a, 5));; ? to have two access functions: ? array_get(), and ? array_set(); Array a = array_create(10); array_set(a, 5, 6); array_set(a, 10, array_get(a, 5));; memory in block int* array_at(Array *a, int index) { if ( index = a-size ) { array_in?ate(a, (index/BLOCK_SIZE +1)*BLOCK_SIZE-a-size); } return (a-array[index]); }; array_in?ate() void array_in?ate(Array *a, int more_size) { int* p = (int*)malloc(sizeof(int)*(a-size +more_size)); for ( int i=0; ia-size; i++ ) p[i] = a-array[i]; free(a-array); a-array = p; a-size = a-size+more_size; }; array_in?ate() void array_in?ate(Array *a, int more_size) { int* p = (int*)malloc(sizeof(int)*(a-size +more_size)); memcpy((void*) p, (void*) a-array, a- size*sizeof(int)); free(a-array); a-array = p; a-size = a-size+more_size; }; int* array_get(Array* a) { return a-array; } ; ? the use of access functions seems not so elegant ? Use operator overload in C++ ? Design speci?c functions for speci?ed application ? Do not treat it as an array; linked-array; issues ? Allocate new memory each time it in?ates is an easy and clean way. But ? It takes time to copy, and ? may fail in memory restricted