How to hashMap an array in Java?

Java recursive array problem. some reason my code is wrong?

• question is: The maximum-valued element of an integer-valued array can be recursively calculated as follows: If the array has a single element, that is its maximum (note that a zero-sized array has no maximum) Otherwise, compare the first element with the maximum of the rest of the array-- whichever is larger is the maximum value. Write an int method named max that accepts an integer array, and the number of elements in the array and returns the largest value in the array. Assume the array has at least one element. my code is: int max(int[] array, int length){ if(length==0) return array[0]; if(array[length-1]>high) int high = array[length-1]; if(length-1==0) return high; max(array, length-1); } what am i doing wrong? the touring's craft page tells me this --> CTest.java:6: '.class' expected

• Answer:

  This method does what the hint says: it compares the first element to the last, and then moves that 'last' in by 1 static int recMax(int[] arr, int len) { ...if (len == 1) return arr[0]; ...return Math.max(arr[0], arr[len - 1]); } This has been tested and works just fine!