I wish people posted more videos like these, where you work through worksheets in computer science.

@taylorswe

5 жыл бұрын

I believe there may be some stuff like this at a website called Kahn academy

@DanT-iu6oc

5 жыл бұрын

EXACTLY

Sir, you are helping a number of students around the 🌎. Hats off ,sir .

This was a life saver, taking the exam in an hour, this really cleared up recursion for me!

yes, the answer to exercise #2 is 32

@SudhanshuKumar-lp1nr

5 жыл бұрын

You're awesome man!!

@raa__va4814

5 жыл бұрын

why is it that the first one's solution isnt 5+5+5+5+5 = 25, instead of 15

@bearclearancedeals1986

4 жыл бұрын

Can you explain how it’s 32?

@Orangesharpie

2 жыл бұрын

@@bearclearancedeals1986 I was confused by this at first too because I was thinking 64. but then I realized the last recursive call just returns 2 and not 2*2

This has helped me immensely! You have literally just saved me. It has taken me forever to learn recursion, and your explanations in this video are wonderful. I cannot thank you enough! God bless you!

I finally get recursion!! I wish there were more videos like this. Great job sir 😊

"Oh well it is what it is" ahah this guy would be an awesome instructor

Wish I had found this last year when I was taking AP Comp Sci.... still useful to me this year in Comp Sci 3 though. Thank you so much!

Definitely got a better handle on the process for tracing algorithms now, thx!

Very well and thoroughly explained, thanks for the tutorial.

I never truly understood recursion until I watched your video--thank you! (Oh yeah, and I'm a CS teacher....o_O)

GODD BLESS YOU BRO YOU SOOOO HELPED ME UNDERSTAND RECURSION TRACE THROUGH, AMENNN MY EXAM IS 2MMRW PRAY I PASS AFTER AND THROUGH JESS

Thanks, these video really explains well.

Amazing, thank you!

Thank you soo much You really made it simple to understand

Very good explain . Thank you so much for making such a useful video

great video, super helpful, helped me understand recursion better than my college lol

Thanks a lot helped me so much

Thanks for your video, it’s very helpful

Very good explanation. Thanks.

saved ny exam day mate.. you are legend

well explained thank you so much.

Thanks for the video ...

Thank you very much

Thank you this helped so muchh

thank you for this vid

Thank u sir....it was really helpful

good

thank you so much

You’re the 🐐

Thanks sir

good tutor

Thanks bro

Is there any way I can print this worksheet?

very high

AMERICAN HERO!!!!!!!!!

I think the best video on recursion on YT tbh - not anything really like this on here

How do I make recursion function for this function . F6 = F4 + F5 , F6 = F4 + F4+F3 , F6 = 2F4 +F3. - Input function(0,13,10) - 10 - you need to find the fibonacci still 10. You are given 6 potition that is 6 and first position is 0. Example F1 = 0 and F6 = 13. 1,1,2,3,5,8,13. The out for 10 positions is 89.

why is it that the first one's solution isnt 5+5+5+5+5 = 25, instead of 15

I’m so upset you didn’t go through the whole thing of number 2 that question is so confusing...

How can I trace a method like maxPathSum()? static int n = 3,m = 3; static int grid[][] = {{5,1,2},{6,7,8},{1,8,9}}; static boolean valid(int i, int j){ return i>=0&&j>=0&&i

Tumi

Bal