Shell sort is a sorting algorithm, devised by Donald Shell in 1959, that is a generalization of insertion sort, which exploits the fact that insertion sort works efficiently on input that is already almost sorted. It improves on insertion sort by all

常用七种排序算法（C#代码） 快速排序、希尔排序、堆排序、选择排序等-Seven kinds of commonly used sorting algorithm (C# code) quick sort, shell sort, heap sort, selection sort, etc.

C++编写的各种排序算法。包括插入排序、堆排序、归并排序、基数排序、冒泡排序、希尔排序、选择排序、直插排序。-C++ written various sorting algorithms. Including insertion sort, heap sort, merge sort, radix sort, bubble sort, shell sort, selection sort, in-line sort.

(1) 对常用的内部排序算法进行比较：直接插入排序、简单选择排序、冒泡排序、快速排序、希尔排序。 　　(2) 利用随机函数产生N（如30000）个随机整数，作为输入数据作比较；比较的指标为关键字参加的比较次数和关键字的移动次数（关键字交换计为3次移动）。 　　(3) 对结果作出简要分析。-(1) internal sorting algorithm commonly used to compare: direct insertion sort, simple selection sort