Recursion in One Shot | Theory + Question Practice + Code | Level 1 - Easy

[mdsarfarazalam]

Fibonacci series: 47:56
Power calculation : 1:00:13
Power calculation in optimized way : 1:12:00 ( log n) its code is : 1:22:40

[onkarvyavahare]

Stack height concept you have tought was nothing anywhere generally...so thank you for such intuition.

[onlythereal]

Really great tutorial i really stuck in recursion but when you teach with very basic questions i really understood it well with what happens in background coding how recursion works 👍☺️☺️👏🙌

[xdnaitiksaraf]

at 30:30
public static int sum(int n){
if (n==0) {
return 0;
}
return n+sum(n-1);
}
is more convinient

[iqbalhossain]

Need this type of practice question in every topic. Hope you continue like this. And thanks for this awesome session😍

[minivishwakarma]

You guys are creating such a valuable content and providing it for free, also motivating us to be better in our fields, hats off to Aman and Shraddha.

[faisalkhan]

This is hands down the most comprehensive lecture for me ! Thank you for making such a high quality, lucid and brilliant explanation video on RECURSION, Your channel is Subscribed right away !

[rajivtripathi]

Great Great great Job!!!!. Actually Recursion is the toughest logic to implement and the way you teach specially coding in which u need to develop the thought process along with the did it so in very simple I have seen lot of videos on you tube but it is the BEST ONE !!!!great Contribution to community!!! Keep up the good work!!!!

[moremansi]

For sum of n natural numbers, i guess correct way with recursion is..

public class Recursion {
public static int printSum(int n) {
if(n==1) {
return 1;
}

return n + printSum(n-1);
}

public static void main(String[] args) {
int n = printSum(5);
System.out.println(n);
}

}

[adityaagarwal]

Didi, backtracking ke upar bhi dedicated playlist banaiye please

[ayushnegi]

i can't explain how easily i was able to understand recursion in this video with time complexity,
thanks a lot to you ma'am

[sambitbhakat]

1:21:32 here when alpha is 4 then hight of stack is 3 not equal to alpha

[JAGMEETHEBEST]

"JEE PREP HO YA COLLEGE KI PADHAI, ONE SHOTS ARE THE BEST!!"😂😂👌

[abhi.]

Best explanation ever..
Finally i understand recursion... 🥳🥳🥳🥳

[abhinitashrivastava]

You are amazing! I am a 52 years old but i understand the concepts very well because of you. Thanks!

[chargeff]

1:24:04 below code works perfectly fine for both even and odd number, no need of using if else condition(if I'm wrong then run this code without condition)
public static int optimisedFunc(int n, int power){
if(power == 1)
return 1;

return (n * optimisedFunc(n, power/2) * optimisedFunc(n, power/2));
}

[prathambharti]

I didn't know Java language but still learning this video because C++ playlist has good content but not for beginainers But it is need more video like this on ds algo

[siddhantpatel]

Thank you so much all team members of aman bhiya aman bhiya you are doing really really really great work . when i wached apna college then i feel I'm graduating form Apna college institute of engineering and technology

[Veds]

just use ternary operator n == 1 || n == 0 ? return 1 : n * factorial(n-1) ; 2 lines of code in just one line using ternary

Thanks mam to make recursion easy to understand

[raunakkumarmishra]

This is something we can call Recursion
Thanku Di and thanku Aman bhaiya to bring such people for us❤🔥