- In C Please 1 (59.14 KiB) Viewed 57 times
- In C Please 2 (78.62 KiB) Viewed 57 times
Task 1 - Your own sorting library: Implement a set of functions to sort an array arr composed of 10000 integers (ascending order). Your library must include the following algorithms Bubble sort Insertion sort Selection sort Quick sort Heap sort . You can find them online do not forget to reference where you found them). It is a good exercise to write them down and try to understand how they work. Furthermore, you will have them available in your own personalized library Your library should also include some additional utility functions - . a function printArray that print out all elements of an array (you can use it to check if your sorting algorithm is correct) a function randomizeArray that initializes an array to random values in the range 10, 99) - to generate random numbers, you can use the function rand() included in the header cstdlib https://www.cplusplus.com/reference/cstdlibland/ a function swap to swap the values of its two parameters (use pointers notation instead of reference notation) a function sortingRunTime that runs a given sorting algorithm and prints out the time of its execution . . Finally, in the main function run all algorithms and compare them to see which one is faster based on the size of your array. Print out the name of the algorithm and the sorting time, exactly like you see in the example below Remember to comment the code such that it is easy for other developers to understand it. Note: You are not expected to remember or understand fully Quick sort or Heap sort - the latter uses advanced data structure theory that we will not see in this course. Just remember they exist, and they are much more efficient than Selection sort