Quicksort (In-place): Background & Python Code

In this video we’ll take another look at the efficient Quicksort algorithm, specifically, we’ll reimplement our prior approach to run in-place. After coding up our new solution, we’ll compare the runtime performance of the in-place version, against the version we developed in the prior video. ► Prior Quicksort Lesson (mentioned in video): **** ► Python Data Structures: ► Video series covering GUI development in Python (WIP): References: [1] [2] End song is “when“ by Stephan Siebert