lecture note:

public class Arrays { /** MODIFIES: a EFFECTS: Sorts a[0], ..., a[a.length - 1] into ascending order. */ public static void sort (int[] a) { if (a == null) return; quicksort (a, a.length - 1); REQUIRES: a is not null and 0 = high) return; int mid = partition (a, low, high); quicksorta, low, mid); quickSort (a, mid + 1, high); (continued on next slide) /** REQUIRES: a is not null and 0 x) j--; while (a[i]