@svdfxd
Awesome video
@shivanisingh2722
Thank you
@siddhanthallan2259
at 4:03,the return type of function should have been int instead of void.
@bharathramkarthikeyan1624
can u make a video on sudoko solving using recursion
@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.
@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?
@Divanshu22verma