Sorting-fast sorting (sorting scheme when small arrays are optimized) and array sorting scheme optimized

Sorting-fast sorting (sorting scheme when small arrays are optimized) and array sorting scheme optimized

# Include <iostream> # include <stdlib. h> using namespace std; # define MAX_LENGTH_INSERT_SORT 7 # define MAXSIZE 10 void ISort (int k [], int n) {int I, j, temp; for (I = 1; I <n; I ++) {if (k [I] <k [I-1]) {temp = k [I]; for (j = I-1; k [j]> temp; j --) // locate the position and move it backwards {k [j + 1] = k [j];} k [j + 1] = temp ;}} void InserSort (int k [], int low, int high) {ISort (k + low, high-low + 1);} void swap (int k [], int low, int high) {int temp; temp = k [low]; k [low] = k [high]; k [high] = temp;} int Partition (int k [], int low, int high) {int point; int m = low + (high-low)/2; if (k [low]> k [high]) {swap (k, low, high );} if (k [m]> k [high]) {swap (k, m, high);} if (k [m]> k [low]) // enables low to store the Intermediate Value {swap (k, m, low);} point = k [low]; while (low