The Partition
do {do {i = i+1;} while (a[i] < pivot && (i < last));
do {loc = loc-1;} while (a[loc] > pivot);
if (i < loc)
{ swap (a(i), a(loc))
}
} while (i < loc);
swap (a(first), a(loc))
}
Previous slide
Next slide
Back to first slide
View graphic version