Sorting
Problem. Sort a given array that contains m+1 integers into non-decreasing order, i.e., rearrange the values in the array so they never decrease.
Rule of Thumb. Write a precise specification
/* Sort A[0..m] into non-decreasing order. */
public void sort(int[] A, int m)
Implementation Constraint: Sort array in place (in situ), i.e., do not use a second array.