Multiplying x * y Using RECURSION

Here we determine how to multiply x and y using recursion. It's a simple idea, by solving a simpler version of the same problem, until we reach a "base" case that we definitely know the answer to (i.e., when one of x and y is 0). However, this idea is very deep in that many problems that use recursion utilize the same basic structure: base cases, and "inductive" cases (a fancy term for "smaller" version of the same problem that you can combine to solve the whole problem).

Contribute: 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=b0_S0X1JwGk