Here we start our Algorithms Lecture series on understanding what an algorithm is - a sequence of instructions that when executed always runs in a finite amount of time (as oppose to a procedure which doesn't make this guarantee). We do a simple example of why algorithms are necessary: inputs need to be specified, the steps given in a precise way, and more. <br /><br />Contribute:<br />Paypal: <a href="https://paypal.me/easytheory" target="_blank" rel="nofollow">https://paypal.me/easytheory</a><br />Patreon: <a href="https://www.patreon.com/easytheory" target="_blank" rel="nofollow">https://www.patreon.com/easytheory</a><br />Discord: <a href="https://discord.gg/SD4U3hs" target="_blank" rel="nofollow">https://discord.gg/SD4U3hs</a><br /><br />Youtube Live Streaming (Sundays) - subscribe for when these occur.<br /><br />Merch:<br />Language Hierarchy Apparel: <a href="https://teespring.com/language-hierarchy?pid=2&cid=2122" target="_blank" rel="nofollow">https://teespring.com/language-hierarchy?pid=2&cid=2122</a><br />Pumping Lemma Apparel: <a href="https://teespring.com/pumping-lemma-for-regular-lang" target="_blank" rel="nofollow">https://teespring.com/pumping-lemma-for-regular-lang</a><br /><br />If you like this content, please consider subscribing to my channel: <a href="https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1" target="_blank" rel="nofollow">https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1</a><br /><br />Gold Supporters: Micah Wood<br />Silver Supporters: Timmy Gy<br /><br />▶SEND ME THEORY QUESTIONS◀<br />[email protected]<br /><br />▶ABOUT ME◀<br />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.<br />...<br /><a href="https://www.youtube.com/watch?v=sT3ImMy0fRE" target="_blank" rel="nofollow">https://www.youtube.com/watch?v=sT3ImMy0fRE</a>