private quick sort()

/* Recursive quick sort logic */
private static void sort(int[] elements, int low, int high) {
    if (high <= low) {                              // 1
        return;                                     // 1
    }
    int j = partition(elements, low, high);         // 2
    sort(elements, low, j - 1);                     // 3
    sort(elements, j + 1, high);                    // 3
}