FindMinRecursion.java

packagecom.thealgorithms.maths;

publicfinalclassFindMinRecursion {

privateFindMinRecursion() {
 }

/**
 * Get min 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 min of {@code array}
 */

publicstaticintmin(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;

intleftMin = min(array, low, mid); // get min in [low, mid]
intrightMin = min(array, mid + 1, high); // get min in [mid+1, high]

returnMath.min(leftMin, rightMin);
 }

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