TASK 1: Commit a new file called t7.c containing correct implementations of all the functions described in list.h. You may use any piece(s) of the supplied code, or write your own. Your code should pass all your tests, and the server’s tests. This is
TASK 1: Commit a new file called t7.c containing correct implementations of all the functions described in list.h. You may use any piece(s) of the supplied code, or write your own. Your code should pass all your tests, and the server’s tests. This is the main function to test the function implementations: http://ideone.com/pxd9Ju TASK 2: Write a function that sorts an instance of our linked list of integers from smallest to largest value. Requirements: Commit a new file called t8.c containing at least the function list_sort() Your file must not contain a main()function or change the structures in list.h. The function must #include the list.h header… … and be consistent with the function declaration: void list_sort( list_t* list ); Use an efficient algorithm. TASK 3: Add and commit the single file “t1.c” that contains implementations of the four functions declared in point_array.h. It may contain other functions too, but remember you are aiming for high performance so you should probably keep things simple. Use realloc() instead of malloc()for high performance. Use a constant time unstable remove. NOTE: I’ve tried this task already. My attempt is attached as t1.c. There’s something wrong with it though. It says:” Program returned 124Error: Your program returned nonzero status code 124stdout —————————————————Creating and initializing array… done.Appending 10000 points to array… *** TIMED OUT (program took too long to run) ***stderr —————————————————*** glibc detected *** ./t1: realloc(): invalid next size: 0x0000000000ffa010 ***”
