Sort

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

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.

should be done in C language......

how the program will display the output is the attached picture....do not just post other expert answer do according to this requirement

Please input size of problem: 100 Direct insert sort needs 5049 times of comparisions. 5148 times of noves Binary insert sort needs 480 times of comparisions, 5148 times of moves Bubble sort needs 4950 times of comparisions, 14850 times of moves Quick sort needs 4950 times of comparisions, 396 times of moves Select sort needs 4950 times of comparisions, 150 times of moves Heap sort needs 662 times of comparisions. 1012 tines of moves Merge sort needs 316 times of comparisions, 1376 times of moves Please input size of