int simplePartition (Comparable ( x, int m, int n, Comparable (y) { Comparable pivot x[m); int high = n, low = m; for (int k = m+1; k 0) { y[high--) x[k]; } else // if (diff 0) // incoming guy is even larger than maximum, this guy becomes { maximumSofar - x[i]; maximaSofar = j; } return maximaSofar; void swap(Comparable [] x, int m, int n) { Comparable temp = x[m); x[m] = x[n]; x[n] = temp; // Task: void selectionRecursive(String array, int n) if in 21 77 3 0) return false; } return true; public static void main(String [] args) Sort sorter = new Sort(); String ( x = new String[]{"a", "z", "al", "b", "11"); int N = 100000; x= new String(N); for (int j=0; j low) { m = (low + high)/2; Comparable M = x[m]; numofcomparisons++; int diff = M.compareTo(target); if (diff 0) high else break; } for(j=k; j>m; j--) { x[k+1] - x[k]; } x[m] = target; } } public void insertSort(Comparable ( x) { numofcomparisons = 0; int k, j, n = x.length; for (k = 0; k=0; j--) { numofcomparisons++; if (x[j+1].compareTo(x[0])