Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove array len + Math.min (#4405)

Browse Source
This commit is contained in:
Lukas 2023-09-26 17:31:16 +02:00 committed by GitHub
parent 02bac7e3d4
commit bf777fff8f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/java/com/thealgorithms/maths/FindMinRecursion.java
View File

@ -21,7 +21,7 @@ public class FindMinRecursion {
} }
assert min(array, 0, array.length - 1) == Arrays.stream(array).min().getAsInt(); assert min(array, 0, array.length - 1) == Arrays.stream(array).min().getAsInt();
assert min(array, array.length) == Arrays.stream(array).min().getAsInt(); assert min(array) == Arrays.stream(array).min().getAsInt();
} }
/** /**
@ -42,7 +42,7 @@ public class FindMinRecursion {
int leftMin = min(array, low, mid); // get min in [low, mid] int leftMin = min(array, low, mid); // get min in [low, mid]
int rightMin = min(array, mid + 1, high); // get min in [mid+1, high] int rightMin = min(array, mid + 1, high); // get min in [mid+1, high]
return Math.min(leftMin, rightMin); return leftMin > rightMin ? rightMin : leftMin;
} }
/** /**
@ -52,7 +52,7 @@ public class FindMinRecursion {
* @param len length of given array * @param len length of given array
* @return min value of {@code array} * @return min value of {@code array}
*/ */
public static int min(int[] array, int len) { public static int min(int[] array) {
return len == 1 ? array[0] : Math.min(min(array, len - 1), array[len - 1]); return array.length == 1 ? array[0] : min(array, 0, array.length);
} }
} }