Recursive Quicksort Algorithm

// Sort b[h..k]

public static void quicksort(int[ ] b, int h, int k) {

if (h+1-k <= 1) return;

if (h+1-k = 2) { // b[h..k] has exactly 2 elements

if (b[h] <= b[k]) return;

// Swap b[h] and b[k] int t= b[h]; b[h]= b[k]; b[k]= t;

return; }

int j= partition(b,h,k);

// b[h..k] looks like

// Sort b[h..j-1]

quicksort(b,h,j-1); // recursive call

// Sort b[j+1..k]

quicksort(b,j+1,k); // recursive call

}

Previous slide

Next slide

Back to first slide

View graphic version