We help IT Professionals succeed at work.

We've partnered with Certified Experts, Carl Webster and Richard Faulkner, to bring you two Citrix podcasts. Learn about 2020 trends and get answers to your biggest Citrix questions!Listen Now

x

How do I make a recursive method for finding the largest element in an array A of N elements?

15jen
15jen asked
on
Medium Priority
650 Views
Last Modified: 2013-12-29
I need to know how to start a program that uses a recursive method in order to find the largest element in an array A of N elements.
Comment
Watch Question

Java Developer
CERTIFIED EXPERT
Top Expert 2010
Commented:
try something like:

public int largest(int[] array)
{
   return largest(array, 0);
}

int largest(int[] array, int start)
   if (start==array.length-1) return array[start];
   else return Math.max(array[start], largest(array, start+1);
}

Not the solution you were looking for? Getting a personalized solution is easy.

Ask the Experts
You can use something like this:

int max(int[] A) {
      return max(A, 0, -Integer.MAX_VALUE);
}

int max(int[] A, int start, int max) {
      if(start>=A.legnth) {
            return max;
      }
      if(A[i]>max) {
            return max(A, start + 1, A[i]);
      }
      return max(A, start + 1, max);
}
Access more of Experts Exchange with a free account
Thanks for using Experts Exchange.

Create a free account to continue.

Limited access with a free account allows you to:

  • View three pieces of content (articles, solutions, posts, and videos)
  • Ask the experts questions (counted toward content limit)
  • Customize your dashboard and profile

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

OR

Please enter a first name

Please enter a last name

8+ characters (letters, numbers, and a symbol)

By clicking, you agree to the Terms of Use and Privacy Policy.