Introduction - If you have any usage issues, please Google them yourself
1) achieve Merging sorting algorithms.
2) fast sorting algorithms.
3) to achieve the heap sort algorithm.
4) achieve bubble sort and selection sort algorithm
(2). Known linear meter of length n A sequential storage structure, please write a time complexity is 0 (n), the space complexity is O (1) algorithm, linear table delete all data elements value item . Requirements: n large number of elements in a linear form, with little data item of the number of elements is required to minimize the number of elements to move deleted array elements with the original order of the array elements do not have to be consistent.
(3). Write a main function, debugging these algorithms. Note: You need to design a linear list of additional initialization function.
(4) For the five sorting algorithm using two lengths of 500,000 linear meter, respectively, test its performance, recording its running time (time to generate the linear form are not counted). The first one: a linear element values within