比快速排序更快的排序算法；这个了示例包含多种数据结构的算法，如InsertSort，ShellSort，BubbleSort，SelectSort，BinaryInsertSort，TableInsertSort，QuickSort，CoutingSort。对于每个算法用1万个数据比较排序性能，并且使用精确计时器（精度远远大于ms，到达us）,使用正序，逆序，随机序列进行比较性能分析。-Faster than the Quicksort sorting algorithm　that the sample contains a variety of data structure algorithms, such as InsertSort, ShellSort, BubbleSort, SelectSort, BinaryInsertSort, TableInsertSort, QuickSort, CoutingSort. For each algorithm using 10,000 data sorting performance, and the use of precision timer (accuracy is much larger than ms, to reach us), the use of positive sequence, reverse, random sequence comparison of performance analysis.