Write a recursive method to find the largest object in an array-based list of Comparable
Chapter 18, Problem 7(choose chapter or problem)
Write a recursive method to find the largest object in an array-based list of Comparable objects. Like the binary search, your method should divide the array into halves. Unlike the binary search, your method should search both halves for the largest object. The largest object in the array will then be the larger of these two largest objects.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer