Recursion prog
9
Recursion Prog Addition of 2 nos #include <stdio.h> #include<conio.h> main() { int add(int pk,int pm); int k = 2; int i; int m = 3; clrscr(); i = add(k,m); printf("i = %d\n",i); getch(); } int add(int addk,int addm){ if(addm==0) return(addk); else return(1+add(addk,addm-1)); }
-
Upload
frijo-francis -
Category
Education
-
view
221 -
download
1
Transcript of Recursion prog
Recursion Prog Addition of 2 nos
#include <stdio.h>#include<conio.h>main(){ int add(int pk,int pm); int k = 2; int i; int m = 3; clrscr(); i = add(k,m); printf("i = %d\n",i); getch();}int add(int addk,int addm){ if(addm==0)
return(addk); else
return(1+add(addk,addm-1));}
Recursion Prog Power function
#include<conio.h>#include <stdio.h>int main(){
double power(double x, int n);double x = 0.0; int n = 0; clrscr();printf("%lf",power(3,2));
getch();}
double power(double x, int n) { if(n == 0) return 1.0; else return x * power( x , n - 1 );}
Recursion Prog Even sum
#include<conio.h>#include <stdio.h>void main(){
int sum(int,int );int total;total=sum(2,4);clrscr();printf("%d",total);getch();
}int sum(int i,int n){
static int even=0;if(i<=n){even=even+i;sum(i+2,n); //calling same function}return even;
}
Recursion Prog Reverse String
void reverse(char a[],int len){ if(len==0) printf("%c",a[len]); else { printf("%c",a[len]); reverse(a,len-1); }}
#include<string.h>void reverse(char [],int b);void main(){char a[26];int len;clrscr();printf("enter string ");Scanf(“%s”,a);len=strlen(a);reverse(a,len);getch();}
Recursion Prog Reverse Number
Int reverse(int num){
if(num>0){
r=num%10;sum=sum*10+r;reverse(num/10);
}else{return sum;
}return sum;
}
#include<conio.h>#include <stdio.h>int sum=0,r;void main(){
int reverse(int);int num,rev;clrscr();printf("\nEnter a number :");scanf("%d",&num);rev=reverse(num);printf("\nAfter reverse the no
is :%d",rev);getch();
}
Recursion Prog Fibnocci Series
void main(){
long term(int);int i,n;clrscr();printf(“Enter Limit”);scanf("%d",&n);printf("\nThe Series is :”);for(i=1;i<=n;i++)
{ printf(" %ld ",term(i)); }
getch();}
long term(int n){
if(n==1)return(0);else if(n==2||n==3)
return 1;else
return(term(n-1)+term(n-2));return 0;}
Recursion Prog Print Pattern
main(){
int i,n;void pat(int);clrscr();for(i=1;i<=10;i++){
pat(i);}getch();
}
void pat(int n){
if(n<1)printf("\n");
else{
printf("%d ",n);n=n-1;mult(n);
}}
Recursion Prog Print Nos in Descenting ordre
main(){
int i,n;void de(int);clrscr();de(20);getch();
}
void de(int n){
if(n==0)return(0);else{ printf("\n %d",n); de(n-1);}
}
Recursion Prog Print EVEN Nos in Descenting ordre
main(){
int i,n;void de(int);clrscr();de(20);getch();
}
void de(int n){
if(n==0)return(0);else{ printf("\n %d",n); de(n-2);}
}
