Partition Algorithm
1. Pivot = a[lb]; lb++;
2. while (lb<=ub){
move lb forward until a[lb]>Pivot;
move ub backward until a[ub]<=Pivot;
exchange a[lb] and a[ub];
lb++; ub--;
}
3. exchange Pivot with a[ub]
Previous slide
Next slide
Back to first slide
View graphic version