Lesson 30.7 Quicksort

From Hannah Lee December 10, 2020

40 plays

The partition algorithm breaks up the list into two kind-of-sorted portions. In this video, we show how to use this fact with divide-and-conquer to implement a new sorting algorithm: quicksort. For many years, this was the default sorting algorithms in most programming languages.

Appears In: CS 1110 Fall 2020

Related Media

Lesson 30.7 Quicksort

Related Media