[virxen]

a better solution is this

#include<stdio.h>
#include<conio.h>
float expo(float,float,int,float);
float term(float,float,float);
int main()
{
 int n;
 float e=0.0,t=1.0,x;
 static float s=1.0;
 //clrscr();
 printf("\nenter variable:");
 scanf("%f",&x);
  printf("\nenter no of terms:");
 scanf("%d",&n);
 e=expo(x,t,n,s);
 printf("\nsum=%f",e);
 getch();
 return 0;
}
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;
  t++;
  return expo(x,t,n,s);
 }
  return(s);
}
float term(float x,float t,float c)
{
 if(t>=1){
  c=c*(x/t);
  return term(x,t-1,c);
 }
  return(c);
}

the error is that when you have a recursive function like above
you must keep a sequential line between its calls and not to break it.

for instance(each one calls its previous )

4!=3!*4=(2!*3)*4=( (1!*1*2)*3 )*4=((0!*1*2)*3)*4

without the return i added here you always return c as the result which is not
changing.

for more on this check this link
http://www.java2s.com/Tutorial/C/016.../Recursion.htm