Posted: Thu Sep 20, 2007 8:20 pm
hello everybody i am not very comfortable with recursion but i tried to solve this problem according to above give algorithm but getting RTE . plz help me and give me some recursion problems . it will be very helpful to me .
thankx
thankx
Code: Select all
#include<stdio.h>
#include<string.h>
char pre[300],in[300];
void fun(int pl,int pr,int il,int ir)
{
int r,lsize,rsize;
for(r=il;r<=ir;r++)
if(pre[pl]==in[r])
break;
lsize=r-il;
rsize=ir-r;
if(lsize>0)
fun(pl+1,pl+lsize,il,r-1);
if(rsize>0)
fun(pl+lsize+1,pr,r+1,ir);
printf("%c",in[r]);
}
int main()
{
int n;
while(scanf("%s%s",pre,in)==2)
{
n=strlen(pre);
fun(0,n-1,0,n-1);
printf("\n");
}
}