Functia Ackermann recursiv #include<iostream.h>long ack(unsigned x,unsigned y){if(x==0) return y+1;if(y==0) return ack(x-1,1);return ack(x-1,ack(x,y-1));} void main(){unsigned m,n;cout<<"m=";cin>>m;cout<<"n=";cin>>n;cout<<ack(m,n);}
Sa se scrie o functie recursiva pentru a transforma un numar natural n, din baza 10 in baza b #include<iostream.h>int n,b; void baza(int n,int b){int r=n%b;if(n>=b) baza(n/b,b);cout<<r;} void main(){cout<<"n=";cin>>n;cout<<"b=";cin>>b;baza(n,b);}
Sa se afle cmmdc pentru 2 numere utilizand varianta recursiva #include<iostream.h>int a,b; int cmmdc(int a,int b){if(a==b) return a;else if (a>b) return cmmdc(a-b,b); else return cmmdc(a,b-a);} void main(){cout<<"a=";cin>>a;cout<<"b=";cin>>b;cout<<"cmmdc: "<<cmmdc(a,b);} {module orizontal600}