To find the largest element of an integer array, the recursive method is implemented

Java version:

 Public classMain { Public Static voidMain (string[] args) {int[] Array = {1, 3, 5, 6, 3, 5, 3, 8};    System.out.println (Findmaxvalue (array)); }    Private Static intFindmaxvalue (int[] Array) {        if(array.length <= 0 | | array = =NULL) {            return-1; }        returnFindmaxvalue (Array, 0); }    Private Static intFindmaxvalue (int[] Array,intstart) {        intLen = Array.Length-start; if(len = = 1) {            returnArray[start]; } Else {            returnMath.max (Array[start], Findmaxvalue (array, start+1)); }    }}

C + + version:

#include <iostream>#include<cmath>using namespacestd;intMaxnum (intArray[],intN) {    if(n = =1)    {        returnarray[0]; }     Else     {        returnMax (array[0], Maxnum (array+1, N-1)); }}intMain () {intnum[Ten] = {0,1,2,3,4,5,6,7,8,9}; cout<<maxnum (NUM,Ten) <<Endl; return 0; }

To find the largest element of an integer array, the recursive method is implemented