oid Reset() //重置\"次数\", 即比较与移动的效率统计

int BubbleSort(int length, int ls[]) //冒泡排序

int InsertSort(int length, int ls[]) //插入排序

int SelectSort(int length, int ls[]) //选择排序

int QuickSort(int length, int ls[]) //快速排序

int ShellSort(int length, int ls[]) //希尔排序

-oid Reset () / / replace "frequency", that compared with the efficiency of mobile statistics int BubbleSort (int length, int ls []) / / int Bubble Sort InsertSort (int length, int ls []) / / Sort int SelectSort insert (int length, int ls []) / / int QuickSort SELECTION SORT (int length, int ls []) / / int Quick Sort ShellSort (int length, int ls []) / / Sort Hi