Recursion
Finally i got what i was seraching for...The total insight on Recursion...
How it flows in a program...how it stacks ad unstacks and operates.
Let us begin.
Let us perform a recursive programming for finding the multiplication of two numbers.
NOTE: i chose this task as it is a bit ahead in class of the factorial recursion and behind the fibonacci series generation....
...
2 results in 0.0023 seconds.
-
Multiplication using recursion
...Code:#include<stdio.h> #include<conio.h> void main() { int mul(int,int); int n1,n2,f=1,ans; clrscr(); while(f==1) { printf("\n***MULTIPLICATION OF TWO NATURAL NUMBERS***"); printf("\nEnter Two Numbers: "); scanf("%d %d",&n1,&n2); if(n1<=0||n2<=0) { printf("\nInvalid Choice...");
