/
NikolayIvkin
/
TheAlgorithms
Обзор
Документация
Войти
/
NikolayIvkin
/
TheAlgorithms
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
src/main/java/com/thealgorithms/maths/FindMaxRecursion.java
40 строк
1 KB
Abhinav Pandey
Improved code readability and code quality (#4663)
11 окт 2023, 14:59
Не верифицирован
11 окт 2023, 14:59
152e290
Код
Авторство
О чём код?
package com.thealgorithms.maths; public final class FindMaxRecursion { private FindMaxRecursion() { } /** * 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} */ public static int max(final int[] array, final int low, final int high) { if (array.length == 0) { throw new IllegalArgumentException("Array must be non-empty."); } if (low == high) { return array[low]; // or array[high] } int mid = (low + high) >>> 1; int leftMax = max(array, low, mid); // get max in [low, mid] int rightMax = max(array, mid + 1, high); // get max in [mid+1, high] return Math.max(leftMax, rightMax); } /** * Get max of an array using recursion algorithm * * @param array contains elements * @return max value of {@code array} */ public static int max(final int[] array) { return max(array, 0, array.length - 1); } }