In Java, Recursively Find Max/Highest Value In Array

import java.util.Scanner;

public class Test1{

    private static int max(int[]nums, int pos){
        int n = nums[pos];
        if(nums.length-1 > pos){
            int m = max(nums, pos+1);
            if(n < m) n = m;
        }
        return n;
    }

    public static void main(String[]args){
        int[]nums = new int[8];
        Scanner in = new Scanner(System.in);
        for(int i = nums.length-1;0<=i;i--){
            System.out.print("Enter number: ");
            nums[i] = in.nextInt();
        }
        System.out.printf("Max value: %d\n", max(nums, 0));
    }
}

Download