Quick Sort (D&C)
← Back to Divide and Conquer
A divide-and-conquer algorithm that partitions around a pivot element. Unlike merge sort, the work is done during the divide step (partitioning) rather than the combine step. In-place partitioning gives excellent cache performance.