Divide and Conquer
Quicksort is a divide and Conquer Algorithm
A divide-and-conquer algorithm is one that divides the problem into smaller problems upon which it performs the same process.
Previous slide
Next slide
Back to first slide
View graphic version