此项目写出了众多排序算法，在给定数组大小的情况下，对一个随机数数组进行排序，统计和比较各大排序算法的时间
本项目中的排序算法有：冒泡排序、选择排序、插入排序、快速排序、另一种快速排序、归并排序、希尔排序、梳子排序、地精排序、基数排序、堆排序、桶排序，一共12种排序算法
- 类定义和函数声明在All_in.h中
- function.cpp中定义了All_in.h中声明的所有函数
- search_sort.cpp定义了主函数main，是该项目的入口
编译运行之后，先输入一个正整数n，n表示一个随机数组中数的数量，意味着排序的规模
This project writes a number of sort algorithms, which sorts an array of random numbers given the size of the array, and counts and compares the time of the major sort algorithms
The sort algorithms in this project are: bubble sort, selection sort, insertion sort, quick sort, another quick sort, merge sort, shell sort, comb sort, Gnome sort, radix sort, heap sort, bucket sort, a total of 12 sort algorithms
- Class definitions and function declarations are in All_in.h
- All functions declared in All_in.h are defined in the function.cpp
- search_sort.cpp defines the main function and is the entry point to the project
After compiling and running, enter a positive integer n, where n represents the number of numbers in a random array, which means the size of the sort