编程实现选择、冒泡、直接插入、希尔、快速、堆、归并等几种排序算法，并计算每种算法的比较、移动次数。-Programming options, bubbling directly into the Hill, quick, heap, merge, etc. of several sorting algorithms, and calculate each algorithm, the number of moves.