... void insertionSort2(int list[], int lo, int hi) { //sort list[lo] to list[hi] in ascending order void insertInPlace(int, int [], int, int); for (int h = lo + 1; h <= hi; h++) insertInPlace(list[h], ... //end main int merge(int A[], int m, int B[], int n, int C[]) { int i = 0; //i points to the first (smallest) number in A int j = 0; //j points to the first (smallest) number in B int k = ... char[]); int binarySearch(int, int, char [], int max, char [][max]); void addToList(char[], int max, char [][max], int[], int, int); void printResults(FILE *, int max, char [][max], int[], int);...