Merge Sort

1void mergeSort(int[] a, int lo, int hi) {2  if (lo >= hi) return;3  int mid = (lo + hi) / 2;4  mergeSort(a, lo, mid);5  mergeSort(a, mid + 1, hi);6  merge(a, lo, mid, hi);7}