int Max(int a[],int n)
{
int max;
if(n==1)
return a[0];
else
max=Max(a,n-1);
if(max>a[n-1])
return max;
else
return a[n-1];
}
Hi, the above is a code to find the max in an array recursively. I
find very difficult in understanding the flow of recursive programs.
Can someone help me out in explaining the flow of the program with
stack sections if possible.
Thanks!!
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
