Recursion Program to compute power of a given number x raised to y #include <stdio.h> #include <conio.h> int power(int x,int n) { if(n==0) return 1;… Read More »Program to compute power of a given number x raised to y
Recursion Program to compute GCD of given two numbers x and y #include <stdio.h> #include <conio.h> /*Recursive function to compute GCD*/ int GCD(int x,int y)… Read More »Program to compute GCD of given two numbers x and y
Recursion Program to solve Towers of Hanoi problem #include <stdio.h> #include <conio.h> void hanoi(int num_disks,char *src,char *tmp,char *trgt); void main() { int disks; char source[10],temp[10],target[10];… Read More »Program to solve Towers of Hanoi problem
Recursion Program to compute factorial of a given number #include <stdio.h> #include <conio.h> /*Recursive Definition*/ /*int factorial(int n) {if(n==0) return 1; else return(n*factorial(n-1)); } */… Read More »Program to compute factorial of a given number
Recursion A function call is said to be recursive, if we invoke a function from within the same function. The phenomenon being referred to as… Read More »Recursion