- 1
Quicksort is an efficient recursive algorithm for sorting arrays or lists of values. The algorithm is a

*comparison*sort, where values are ordered by a comparison operation such as […] or […. - 2
The key to Quicksort’s runtime efficiency is the division of the array. The array is partitioned according to comparisons with the pivot element, so which pivot is the optimal choice to produce su…

- 3
Quicksort is an efficient algorithm for sorting values in a list. A single element, the pivot, is chosen from the list. All the remaining values are partitioned into two sub-lists containing the v…

- 1
We’ll be implementing a version of the quicksort algorithm in Python. Quicksort is an efficient way of sorting a list of values by partitioning the list into smaller sub-lists based on comparisons…

- 2
Quicksort works by selecting a pivot element and dividing the list into two sub-lists of values greater than or less than the pivot element’s value. This process of “partitioning” the list breaks t…

- 3
We need to partition our list into two sub-lists of greater than or smaller than elements, and we’re going to do this “in-place” without creating new lists. Strap in, this is the most complex port…

- 4
We’ve made it through the trickiest portion of the algorithm, but we’re not quite finished. We’ve partitioned the list once, but we need to continue partitioning until the base case is met.

Let’s…

- 5
Congratulations on implementing the quicksort algorithm in Python. To review: 1. We established a base case where the algorithm will complete when the […] and […] pointers indicate a list …

## How you'll master it

Stress-test your knowledge with quizzes that help commit syntax to memory