Introduction - If you have any usage issues, please Google them yourself
( 1 ) . For linear sequence of storage table, the following functions:
1 ) to achieve two-way merge sort algorithm .
2 ) fast sorting algorithm.
3 ) to achieve heap sort algorithm.
4 ) to achieve bubble sort and selection sort algorithm
( 2 ) . Known linear meter of length n A sequential storage structure , please write a time complexity of 0 (n), space complexity is O (1 ) of the algorithm, which deletes all the values of the linear form item data elements . Requirements: linear form n large number of elements , while the number of elements is very little data item , and the number of elements required to move as little as possible array elements deleted after the original order of the array elements do not have to be consistent .
( 3 ) . Write a main function, debug these algorithms. Note : requires additional design a linear table initialization function .
( 4 ) For the five sorting algorithms , using two lengths of ten million linear tables were tested for pe