直接插入排序，简单选择排序，递归版快排，非递归版快排的实现，其中递归版快排有加以优化。另外，测试函数产生2万个随机数进行排序，并输出各排序方案排序时间以便对比。（欲改变测试数据的数量只需在头文件中改变宏定义的量）-Direct insertion sort, simple selection sort, recursive version fast row, row non-recursive version of fast realization, wherein the recursive version of fast row have to be optimized. In addition, the test functions to generate 20,000 random numbers are sorted, and outputs each time the sort ordering scheme for comparison. (To change the test data volume by simply changing the number of macros defined in the header file)