algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-08 10:15:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Remove array len + Math.max (#4401)

Browse Source
This commit is contained in:
Lukas
2023-09-25 21:10:04 +02:00
committed by GitHub
parent 01157f299c
commit cada67b1eb
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
src/main/java/com/thealgorithms/maths/FindMaxRecursion.java
View File

@ -17,7 +17,7 @@ public class FindMaxRecursion {
array[i] = rand.nextInt() % 100; array[i] = rand.nextInt() % 100;
} }
assert max(array, array.length) == Arrays.stream(array).max().getAsInt(); assert max(array) == Arrays.stream(array).max().getAsInt();
assert max(array, 0, array.length - 1) == Arrays.stream(array).max().getAsInt(); assert max(array, 0, array.length - 1) == Arrays.stream(array).max().getAsInt();
} }
@ -39,17 +39,16 @@ public class FindMaxRecursion {
int leftMax = max(array, low, mid); // get max in [low, mid] int leftMax = max(array, low, mid); // get max in [low, mid]
int rightMax = max(array, mid + 1, high); // get max in [mid+1, high] int rightMax = max(array, mid + 1, high); // get max in [mid+1, high]
return Math.max(leftMax, rightMax); return leftMax < rightMax ? rightMax : leftMax;
} }
/** /**
* Get max of array using recursion algorithm * Get max of array using recursion algorithm
* *
* @param array contains elements * @param array contains elements
* @param len length of given array
* @return max value of {@code array} * @return max value of {@code array}
*/ */
public static int max(int[] array, int len) { public static int max(int[] array) {
return len == 1 ? array[0] : Math.max(max(array, len - 1), array[len - 1]); return array.length == 1 ? array[0] : max(array, 0, array.length);
} }
} }