Sort

[Problem Description]

Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort.

[Basic Requirements]

1. Raw data is generated randomly.
2. For different problem size, output the number of comparisons and moves required by various sorting algorithms
3. When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale.