内部排序算法比较

问题描述：编制一个演示内部排序算法比较的程序。可对冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序和堆排序进行比较。

算法输入：排序方法选择，待排序的元素的关键字，关键字序列的给出方式（正序、逆序和乱序）

算法输出：不同情况下关键字参加的比较次数和关键字的移动次数。

算法要点：（1）由键盘输入待排序表的表长（50到100）和不同测试数据的组数。（2）利用不同排序方法排序并统计两类次数，列表显示（3）程序以对话方式执行。

-Comparison of the internal sorting algorithm

Problem descr iption: internal sorting algorithm demonstrates the preparation of a comparative process. Can bubble sort, direct insertion sort, simple selection sort, quick sort, sort and heap sort Hill comparison.

Algorithm Input: sorting method selection, the elements to be sorted keywords, given the sequence mode (positive sequence, reverse and random order)

Algorithm output: keywords under different circumstances the number of comparisons involving the mobile number and keyword.

Algorithm points: (1) sort the table by the keyboard input table to be long (50 to 100) and different number of groups of test data. (2) methods using different sort order and the number of statistical categories, the list display (3) program implementation through dialogue.