Question

I am doing this assignment and I am having trouble writing this method recursively.
I have this way to do it which is effective but not recursive:

public static <T extends Comparable< ? super T>> T getLargest(T [] a, int low, 
              int high)
{
    if(low>high)
            throw new IllegalArgumentException();
    return Collections.max(Arrays.asList(Arrays.copyOfRange(a, low, high)));

So from there I went to this one, which kind of extends it but is not recursive either:

T[] arrCopy = (T[]) new Object[high-low];
    for(int i=low;i<high;i++){
        if(a[i].compareTo(a[i-1])>0)
            arrCopy[i]=a[i];
        else
            arrCopy[i]=a[i+1];
    }
    return arrCopy[0];

And I’ve been working on it for hours and can’t seem a way to make it recursive and make it work.
Any help and ideas are greatly appreciated!

Answer 1

This would be the right answer:

T tmp = a[low];
    for(int i=0;i<=high;i++){
        if(a[i].compareTo(tmp)>0){
            tmp = a[i];
            getLargest(a,i,high);               
        }
    }
    return tmp;