I need to use recursion to find the largest int in an array. What I have so far is

#include <iostream>
using std::cout;
using std::endl;

int maxArray(int anArray[], int size);

/**
 *The main method
 *
 *@param myArray[] The array we are searching
 *
 *@param sizeOfArray The size of the array
 *
 *@param largestNumber  The largest number in the array
 */
int main(){

  int myArray[] = { 1, 6, 8, 3 };

  int sizeOfArray = sizeof(myArray)/sizeof(*myArray);

  int largestNumber = maxArray(myArray, sizeOfArray);

  cout<< "the largest number of the array is " << largestNumber << endl;

  return 0;

}//end main

/**
 *This method finds the largest int in an array
 *
 *@param anArry The array of integers
 *
 *@param size The size of the array
 *
 *@return The largest number in the array
 */
int maxArray(int anArray[], int size){

  if(size == 0){

    cout << "empty array" << endl;

  }

  if(size == 1 ){

    return anArray[0];

  }else{
    
    return maxArray(anArray, size-1);
    
  }

}//end maxArray

So I can get down to finding the first item in the array, but I cant figure out how I would go about getting to the 2nd, 3rd, 4th, etc items in the array using a recursive function and then once I get down to the one int how would I go about comparing that int to another int in the array. Im confused, any suggestions on how I can get over my hump of at least getting to the next element in the array. Id appriciate any suggestions/help/examples from other programs or any sites that would guide me in the right direction. And no I dont want you to do this for me, I just want a hint or suggestion so I can get unstuck. Thanks.

Ironically, this isn't the greatest example of recursion; it could probably be solvedd with a simple loop. :rolleyes:

However, since your instructor requires you to do it, here is basically what you should do when you actually get to the point where it's going to call itself: call the function, and instead of returning the value, store it in a variable. If this value is greator than the one it already has, return this latest value. Otherwise return the original value.

To make it clearer:

int maxArray(int anArray[], int size){

  if(size == 0){

    cout << "empty array" << endl;

  }

  if(size == 1 ){

    return anArray[0];

  }else{
    
    tempVariable = maxArray(anArray, size-1);
 // if this tempVariable is larger than anArray[size]:
//     return tempVariable
// otherwise just return  anArray[size]
    
  }
}//end maxArray

Try this one

#include<iostream.h>
#include<conio.h>


int find(int *a,int start,int end)
{


	if(start<end)
	{

		if(a[start]<a[end])
		{

		cout<<"1st Arrys condition"<<a[start]<<" "<<a[end]<<endl;
		return find(a,start+1,end);

		}
		else
		cout<<"2nd Arrys condition"<<a[start]<<" "<<a[end]<<endl;
		return find(a,start,end-1);

	}
	cout<<"Last= "<<a[end]<<endl;
}

void main()
{
clrscr();

const int size=8;
int arr[size]={7,6,13,12,2,9,5,99};

for(int i=0;i<size;i++)
{
	cout<<arr[i]<<" ";
}
cout<<endl;
find(arr,0,size-1);

getch();
}
Comments
Though it is non-standard code and you answered lately and you gave away code. It is really a neat recursive algorithm though there is no case if a[start]==a[end];
Copy/paste answer for no reason (http://www.daniweb.com/forums/post867983.html#post867983) and TWO YEARS too late
void main, non-standard code, Giving code to noob. There are multiple reason for a bad reputation
This article has been dead for over six months. Start a new discussion instead.