FindMaxRecursion.java

packagecom.thealgorithms.maths;

publicfinalclassFindMaxRecursion {

privateFindMaxRecursion() {
 }
/**
 * Get max of an array using divide and conquer algorithm
 *
 * @param array contains elements
 * @param low the index of the first element
 * @param high the index of the last element
 * @return max of {@code array}
 */
publicstaticintmax(finalint[] array, finalintlow, finalinthigh) {
if (array.length == 0) {
thrownewIllegalArgumentException("Array must be non-empty.");
 }
if (low == high) {
returnarray[low]; // or array[high]
 }

intmid = (low + high) >>> 1;

intleftMax = max(array, low, mid); // get max in [low, mid]
intrightMax = max(array, mid + 1, high); // get max in [mid+1, high]

returnMath.max(leftMax, rightMax);
 }

/**
 * Get max of an array using recursion algorithm
 *
 * @param array contains elements
 * @return max value of {@code array}
 */
publicstaticintmax(finalint[] array) {
returnmax(array, 0, array.length - 1);
 }
}