hi here is a program for exponential but it desn,t work properly pls tell me the correction Code: #include<stdio.h> #include<conio.h> float expo(float,float,int,float); float term(float,float,float); main() { int n; float e=0.0,t=1.0,x,s=1.0; clrscr(); printf("\nenter variable & no ofterms:="); scanf("%f%d",&x,&n); e=expo(x,t,n,s); printf("\nsum=%f",e); getch(); return; } float expo(float x,float t,int n,float s) { float c=1.0,e=0; if(t<n) { e=term(x,t,c); s=s+e; expo(x,t+1.0,n,s); } return(s); } float term(float x,float t,float c) { if(t>=1) { c=c*(x/t); term(x,t-1,c); } return(c); }

fatima, if you are intrested to solve this problem,pls copy the prog and run for x=1 and number of term n=5 the answer should be 2.7016

hi abinila,i cant describe the problem but prob in recursion due to this, prog doesn,t able to calculate correct result. if u r really intrested to solve the problem run it for x=1 and n=5 the answer should be 2.7016

quicksort ============== http://alienryderflex.com/quicksort/ http://www.comp.dit.ie/rlawlor/Alg_DS/sorting/quickSort.c http://cprogramminglanguage.net/quicksort-algorithm-c-source-code.aspx http://www.daniweb.com/code/snippet216793.html#