Ad:

C Discussion Thread
Unsolved
Views: 2275

Sep 13th, 2005

help with recursion

Expand Post »

I am having a problem with a recursion problem. I have been reading alot of threads on this subject here and other places. I think I understand what recursion is. I am just having a problem trying to figure out this problem. I am suppose to write a helper function for maxarray.

Searching an array Find the maximum element in an unsorted array
if (anArray has only one item)
maxArray(anArray) is that item
else if (anArray has more than one item)
maxArray(anArray) is maximum of
maxArray(left half of anArray) and
maxArray(right half of anArray)

In the call tree it looks like this:
1st level:
maxArray(<1,6,8,3>)
return max(maxArray(<1,6>), maxArray(<8,3>))

2nd level
maxArray(<1,6>) maxArray(<8,3>)

return max(maxArray(<1), maxArray(<6>)) return max(maxArray(<8), maxArray(<3>))

3rd level
maxArray(<1>) maxArray(<6>) maxArray(<8>) maxArray(<3)

I am suppose to write the helper function max. I have no idea how to get started. Any help on this would be much appreciated. Thank you.

you can see more info an call tree at this link:http://www.cs.wm.edu/~debbie/cs241/r...recursion.html

#12 searching an array

Similar Threads

Recursion in C
C++ Beginner - #include recursion problem in C++
Recursion: when do you use it? in C++
Recursion in C++
number formatting using recursion in Java

skeet123

Reputation Points: 10

Solved Threads: 0

Unverified User

Offline

20 posts
since Nov 2004

Permalink

Sep 13th, 2005

Re: help with recursion

You don't necessarily need to make a max function, you could actually use a define like the following:

C Syntax (Toggle Plain Text)

#define MAX(a, b) ((a) > (b) ? (a) : (b))

chrisbliss18

Reputation Points: 38

Solved Threads: 25

Posting Shark

Offline

902 posts
since Aug 2005

Permalink

Sep 13th, 2005

Re: help with recursion

Hi,
Following should work fine

C Syntax (Toggle Plain Text)
int max(int *array, int len)
{
  int n1,n2;
  if(len == 1) return array[0] ;
 
 
  n1 = max(array , len/2);
  n2 = max(array + len/2 , len - len/2) ;
  return (n1 > n2 ? n1 : n2) ;
}
 
 
int main()
{
   int A[] = {2,7,91,8,9,11} ;
   int B[] = {2,7,91,8,9} ;
 
   printf("\n%d ",max(&A[0], 6));
   printf("\n%d\n ",max(&B[0], 5));
}
int max(int *array, int len)
{
  int n1,n2;
  if(len == 1) return array[0] ;


  n1 = max(array , len/2);
  n2 = max(array + len/2 , len - len/2) ;
  return (n1 > n2 ? n1 : n2) ;
}


int main()
{
   int A[] = {2,7,91,8,9,11} ;
   int B[] = {2,7,91,8,9} ;

   printf("\n%d ",max(&A[0], 6));
   printf("\n%d\n ",max(&B[0], 5));
}

<< moderator edit: added [code][/code] tags >>

aj.wh.ca

Reputation Points: 12

Solved Threads: 1

Junior Poster in Training

Offline

53 posts
since Mar 2005

Permalink

Sep 13th, 2005

Re: help with recursion

Thanks both of you for your reply.

skeet123

Reputation Points: 10

Solved Threads: 0

Unverified User

Offline

20 posts
since Nov 2004

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C Forum Timeline: procedure and object-oriented !

Next Thread in C Forum Timeline: Help me with this Simple Problem plss

DaniWeb Message

Cancel Changes

User Name
Password