Internal-comparison-algorithm

代码说明：

  系统用srand()函数产生一个以当前时间开始的随机种子。其产生的种子用选择排序、冒泡排序、快速排序将顺序表中的数字排好，设置变量记录每种排序关键字的移动次数和关键字的比较次数。选择排序：利用L.length-1个循环，将随机种子按从小到大的顺序排好。(System with srand () function generates a random seed to start the current time. Which produces seeds with selection sort, bubble sort, quick sort the order of numbers in the table lined up, set the variable record number of comparisons for each mobile number and keyword sort key. Sort: use L.length-1 cycle, the random seed small to large order lined up. )