This is such a good explanation of the logic behind recursive programs. Other explanations always start with the code and then work backwards to the logic/maths.
very good examples. you could also have talked about the problems when running on systems with limited ram and the cost of each recursion call/nest in terms of stack memory and stack overflow which may happen even on larger machines.
Yeah I think I’m going to do a separate video on stack overflow errors, and other ideas that come up with recursion, like head vs tail recursion, and direct vs indirect recursion. :-)
Hmm, maybe I can do a video on that. :-) How is the two's complement represented, with a string of 0s and 1s? So for example the program might work like this: Enter Integer: -34 Two's Complement: 11011110 Where "-34" is an integer entered by the user and "11011110" is a string created by the program? :-)
This is such a good explanation of the logic behind recursive programs. Other explanations always start with the code and then work backwards to the logic/maths.
Thank you, I'm glad you enjoyed the explanation! :-) I want to do videos on head vs. tail recursion and direct vs. indirect recursion too.
I finally understood recursion. Thank you very much!
Thank you very much, I was having trouble understanding this topic, it is really hard finding an explanation this well made
You’re very welcome, I’m glad this video was able to help you out! :-)
Thanks for your time. Best channel in teaching C!
You're weclome Νίκος, I'm glad you enjoy the channel and thanks for the support! :-)
Very good explanation of recursion! Thanks a lot.
I love C and after a long period i gonna use it again.
You're welcome Marc, I'm glad you enjoyed it! :-) And I love C too, it's such a fun language.
Thanks for your easy explanation.
You’re welcome! :-)
very good examples. you could also have talked about the problems when running on systems with limited ram and the cost of each recursion call/nest in terms of stack memory and stack overflow which may happen even on larger machines.
Yeah I think I’m going to do a separate video on stack overflow errors, and other ideas that come up with recursion, like head vs tail recursion, and direct vs indirect recursion. :-)
I'm always learning something new from your videos :)
Awesome, glad to hear that! :-)
This video is amazing
Thank you, I'm glad you enjoyed it! :-)
exilent explication
Merci 😊
You're welcome! :-)
Can you do a video on a code to find the two’s complement of a binary number
Hmm, maybe I can do a video on that. :-) How is the two's complement represented, with a string of 0s and 1s? So for example the program might work like this:
Enter Integer: -34
Two's Complement: 11011110
Where "-34" is an integer entered by the user and "11011110" is a string created by the program? :-)
@@PortfolioCourses Yes that exactly. I figure out how to do it, but still would make a good video.
@@EvanWelborn4 OK interesting maybe I can do that one day then. 🙂
Wait but is there 0th term in Series. Sir, please check that out once... The 10th term of Fibonacci should be 34 not 55
Some authors start the sequence at 1 and 1, Fibonacci actually started it at 1 and 2, it’s not important at all to the video either. :-)
Amazing++
Thank you Hasdrubal, I'm glad you enjoyed it! :-)
thanks
You're welcome! :-)
Recursion: one of the most overrated techniques: espoused by academics, but very rarely used in practice.