Like mergesort, it is easily parallelized because it is a "divide-and-conquer algorithm."
The depth of the call tree of this algorithm is Θ (theta) [log n], and in its worst case runtime, the call tree becomes a linear chain of n nested cells. That worst-case scenario can be avoided by using a selection algorithm to pick the kth smallest element in its first step. Like mergesort, it is easily parallelized because it is a "divide-and-conquer algorithm." Developed by C.A.R. Hoare, for 10 points, name this algorithm that selects a pivot, divides the set, and recursively reorganizes each set, an algorithm named for its ability to partition elements in a set relatively rapidly.
The depth of the call tree of this algorithm is Θ (theta) [log n], and in its worst case runtime, the call tree becomes a linear chain of n nested cells.
{quicksort}