试分别实现交换排序和非递归形式的快速排序算法，并通过随机数据比较两种排序算法的关键字比较次数和关键字移动次数。

（1）待排序表的表长不小于100；其中的数据要用伪随机数产生程序产生；至少要用5组不同的输入数据作比较；比较的指标为有关键字参加的比较次数和关键字的移动次数（关键字交换计为3次移动）。

（2）最后要对结果作出简单分析，包括对各组数据得出结果波动大小的解释。

（3）对快速排序算法进行适当的优化，并列出优化前后的效率对比。

-Subjects were asked to achieve order and non-recursive form of the exchange of quick sort algorithm, and random data were compared by sorting algorithms compare the number of keywords and keyword mobile number. (1) to be sorted table table long is not less than 100　which data to use pseudo-random number generation procedures　be at least 5 different sets of input data for comparison　comparable indicators with the participation of more number of keywords and mobile number of keywords (keyword exchange of dollars for the 3 mobile). (2) the last to make a simple analysis of the results, including the outcome of each set of data to explain the size of fluctuations. (3) of the quick sort algorithm is optimized properly, and sets out the efficiency of comparison before and after optimization.