1）实现二路归并排序算法。

2）实现希尔排序算法。

3）实现快速排序算法。

4）实现堆排序算法。

（6）已知长度为n的线性表A采用顺序存储结构，该算法删除线性表中所有值为item的数据元素。删除后的数组元素与原数组元素不必保持顺序一致。

一个主函数,调试上述算法。-1) Achieving way merge sorting algorithm. 2) Achieving Hill sorting algorithms. 3) The fast sorting algorithms. 4) The realization of the heap sorting algorithm. (6) known to the length of n-linear form A sequence-storage structure, the algorithm is linear in the table to delete all values of data elements for the item. Deletion of the array elements with the original order of the array elements do not have to keep in line. A main function, debugging the algorithm.