Quicksort Algorithm

A divide-and-conquer sorting algorithm with O(n log n) average time complexity

Practice Quicksort

Test your understanding! Try partitioning the following array with the first element as the pivot:

[ 7, 2, 1, 6, 8, 5, 3, 4 ]