... CHAPTER 1 ■ SORTING, SEARCHING, AND MERGING12Using insertInPlace, we can rewrite insertionSort (calling it insertionSort2) as follows: void insertionSort2(int list[], int lo, int hi) { //sort ... list[hi] in ascending order void insertInPlace(int, int [], int, int); for (int h = lo + 1; h <= hi; h++) insertInPlace(list[h], list, lo, h - 1); } //end insertionSort21.4 Sorting an Array ... CHAPTER 1 ■ SORTING, SEARCHING, AND MERGING10Program P1.2 #include <stdio.h> #define MaxNumbers 10 int main() { void insertionSort(int [], int); int num[MaxNumbers]; printf("Type...