Asymptotic Analysis and Runtime - Easy Theory

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

Chapters: 0:00 - Intro 1:10 - Asymptotic Analysis 5:56 - Big-O, Big-Omega, Big-Theta 12:59 - Asymptotic Runtime 17:46 - Solving the runtime for Mergesort and Quicksort 27:59 - Solving the runtime for Towers of Hanoi 34:07 - Conclusion

Here we look at asymptotic analysis, which will help us analyze the runtime of algorithms in a more formal way, and we solve the runtime of both the merge and quick sort algorithms (assuming a good pivot for quick sort), as well as the Towers of Hanoi algorithm.

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=rP5peOkXsbY