@bharathramkarthikeyan1624
can u make a video on sudoko solving using recursion
@siddhanthallan2259
at 4:03,the return type of function should have been int instead of void.
@ameypimple6502
Thanks a lot! amazing explaination!
@lifeincanada7763
Excellent. Thank you for making this video.
@Divanshu22verma
Nice 👌
@svdfxd
Awesome video
@shivanisingh2722
Thank you
@amanranjanverma
Which is more efficient in this case; iterative factorial or recursive factorial. Both seem to have the same time complexity. iterative take constant space whereas recursive takes o(n) intermediate stack space.
@arpitasood2657
great video:)
@VikasAdiwal
num < 2: return num will return 0 for num = 0 which is wrong....fact(0) should b 1. d condition shud b if num < 2 return 1
@hanaasihanish
How to find the time complexity of recursive functions?
@roopasingh4113
How to install this IDE, can you make tutorial on how to install visual studio?
@ctbram0627
why not ---
public static int Factorial(int n){
if (n==1) return 1;
return n * Factorial(n-1);
}
done! Why the facto crap and else?
@harisaran1752