/* program to show recursion using graphs without using any library.. plz enter 3 numbers separated by spaces for eg 3 4 5..... first recursion :t(n)= t(n-1)+n second recursion :t(n)= t(n-1)+n^2 third recursion :t(n)=2(t(n/2))+ n.. actuall u r entering three values so that a loop is going to run from 0 to 3 and will generate recursion series going from n= 0 to n= 3 and also show the respective graph... similarly for the second recursion graph n=4 and thus it will generate recursin values from 0 to 5 and will represent the respective recursion values on a graph... similarly 6 for recursion 3... so , just enter 3 numbers separated by spaces... eg 4 5 6*/ #include //#include using namespace std; void sortasc(int ar[],int sz) { for(int i=0;i=0;i--) { if(i!=0) { yc=ar[i]-ar[i-1]; } for(int j=0;j>no1; no1++; int * array1 = new int[no1]; recur1helper(array1,no1-1); cout<<" \n the recursion generated for the function t(n)=t(n-1)+n : "; for( i=0;i>no2; no2++; int *array2 = new int[no2]; recur2helper(array2,no2-1); cout<<"\n recursion generated for the function t(n) = t(n-1)+n*n : "; for( i=0;i>no3; no3++; int *array3 = new int[no3]; recur3helper(array3, no3-1); cout<<"\n the recursion generated for the function t(n) = 2(t(n/2))+n : "; for( i=0;i

recursion_graphs_without_graph_library(own_simple_logic)