What is Quicksort? An Animated Introduction

Learn how quicksort works with colorful animations and simple explanations. This video introduces the basics of the quicksort algorithm, which is really a family of related algorithms. How do the various quicksorts differ? And how does quicksort compare to other sorting algorithms? This video answers all that and more. The sorting visualizations in this video show each= step of the quicksort algorithm in accurate detail, so that you can learn by watching.

Specifically, the video introduces:
1. What different pivots can quicksort use?
2. The different partition schemes
3. More detail and pseudocode for Lomuto's partitioning scheme
4. A comparison of quicksort with merge sort, another divide and conquer sorting algorithm. This section includes merge sort's and quick sort's average-case time complexity, worst-case time complexity, and space requirements in terms of big O notation/asymptotic complexity.

This is a great video for computer science students, educators, or programmers in general looking to sharpen their data structures and algorithms (DSA) knowledge. I hope you'll get a lot of value and understanding out of the sorting animations I've made!

References:
For quicksort correctness and general information, see CLRS Algorithms (ie, Introduction to Algorithms from MIT press) 4th edition, Chapter 7. I'm not sure if I'm allowed to post a link to the full PDF of the book, but it's not hard to find.

The code I used for the partitioning schemes, and the pseudocode presented, is more similar to what's shown on the Wikipedia page for quicksort. I find these more accessible than the listings in CLRS.
Wikipedia on Quicksort (pseudocode for Hoare's partitioning scheme, good general info on quicksort algorithm)
en.wikipedia.org/wiki/Quicksort