Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Partition an array and return the pivot index */
- private static int partition(int[] elements, int low, int high) {
- int i = low; // 1
- int j = high + 1; // 1
- while (true) { // 2
- while (less(elements[++i], elements[low])) { // 3
- if (i == high) { // 3
- break; // 3
- }
- }
- while (less(elements[low], elements[--j])) { // 4
- if (j == low) { // 4
- break; // 4
- }
- }
- if (i >= j) { // 5
- break; // 5
- }
- swap(elements, i, j); // 6
- }
- swap(elements, low, j); // 7
- return j; // 7
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement