Merge Sort, Explained
Easy Theory
Here we continue with recursion about merge sort, which is a recursive algorithm to sort a list. The idea is to define recursive cases as being a sorted "smaller" version of the list, and to have multiple pieces of the list that are sorted individually. Then, we "merge" the multiple pieces together to sort the whole list. The base case here is when we have 1 element, which is always sorted.
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=XsTgN-jKMUQ
58208089 Bytes