Discrete Math - 5.4.1 Recursive Algorithms

Revisiting writing algorithms, this time related to recursive definitions. We also look at how to prove an algorithm.

Video Chapters:
Introduction 0:00
Recursive Algorithms 0:12
Pseudocode for GCD 1:32
Pseudocode for Computing n! 4:49
Pseudocode for computing a^n 6:58
Prove Algorithm for a^n 8:48
Up Next 10:09

Textbook: Rosen, Discrete Mathematics and Its Applications, 7e

[Athletichick]

Thank you so much! Hope you're staying safe amidst everything going on.

[linzhang]

Thank you so much, you're lifesaver!! continue doing what you're doing!!

[positiveanion]

watching it from India. in my university we are also taught with Kenneth Rosen's book.

[NutirtionCat]

Hey! Shouldn't there be a loop to keep looping through a, b unttil a=0? In my understanding, the if statement doesn't loop. Thanks for the great videos btw!

[TenzinGyaltso]

When you first introduced recursive algorithms you put gcd(14, 20) then after you put gcd(14, 6) which didn't make sense at first because I thought the 6 would go before the 14 but then the next slide showed you doing the way I was thinking so maybe you wrote it wrong in the beginning.

[johnhouston]

Thank you so much for your helpful videos. They have are great.

[Sylvia_Mwai]

Thankyou so much for your help....i wish i had seen this before my cat paper but since i now have it am gonna ace that final exam paper