The Quicksort Algorithm + more Recursion!

Here we look at the quicksort algorithm, which is another sorting algorithm that uses recursion. The idea is that it is very similar to mergesort, but instead of recursively working on the two halves and then merging, we first "split" the array into two pieces, and then recursively work on the two pieces. The idea is to pick a "pivot" element, and to move all of the other elements to the "correct side" of this pivot element. The two halves are just the partition created by this pivot.

Contribute: Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Youtube Live Streaming (Sundays) - subscribe for when these occur.

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

Gold Supporters: Micah Wood Silver Supporters: Timmy Gy

▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com

▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes. ... https://www.youtube.com/watch?v=bDM-OCeynfQ