Recursive function in C to compute a power b

[@fero___3005]

Wonderful explanation

[@bossysmaxx]

hey man What type of Pen or Notebook you're USing Tell me

[@mithunshaha4342]

what a concept it is!

[@mrSolo295]

Return to whome?? If we return to main() when b==1 then only 3 will go. Also after when b==1 and return a; is executed y not the third statement is not executed because their is only if part and not else. Im really confused , i will b thankfull if u could help me out.

[@ankurkushwaha21]

sir, can u please upload for fibonacci series.

[@ADH_01]

Thanks sir...

[@Abhijeetkumar314]

nice explanation which notebook r u using?

[@tuhinprasad6508]

This video helped !! Thanks

[@gzmgzm4645]

Help ! how to solve ? 2. What does f(5) return? What does the function do? int f(int n){ if(n

[@Niamat-w9s]

thanks

[@aayush5474]

What notebook is that?

[@bossysmaxx]

i also wanted to know?

[@ogendrayadav5503]

it is not work for ZERO(0) power.

[@ogendrayadav5503]

best idea is given below #include int power(int n1 , int n2); int main() { int x, n,num; printf("Enter base number: "); scanf("%d", &x); printf("Enter Power number: "); scanf("%d", &n); num=power(x,n); printf(" %d^%d = %d", x, n,num ); return 0; } int power(int n1, int n2) { if(n2 == 0) return 1; return (n1*power(n1, n2-1)); }

[@ramutry]

It is not work for negative powers👎