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

cleanup FindMinRecursion (#4568)

Browse Source 
* Create FindMinRecusionTest.java

* Update FindMinRecursion.java

* Update FindMinRecursion.java

* Update FindMinRecursion.java

* Rename FindMinRecusionTest.java to FindMinRecursionTest.java

* Update FindMinRecursionTest.java

* style: remove unused imports

---------

Co-authored-by: vil02 <65706193+vil02@users.noreply.github.com>
This commit is contained in:
Lukas
2023-10-05 22:01:27 +02:00
committed by GitHub
parent 06d6e2116b
commit 064ca8f591
2 changed files with 36 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,38 +1,13 @@
package com.thealgorithms.maths;
import java.util.Arrays;
import java.util.Random;
public final class FindMinRecursion {
public class FindMinRecursion {
/**
* Driver Code
*/
public static void main(String[] args) {
Random rand = new Random();
/* rand size */
int size = rand.nextInt(100) + 1;
int[] array = new int[size];
/* init array with rand numbers */
for (int i = 0; i < size; i++) {
array[i] = rand.nextInt() % 100;
}
assert min(array, 0, array.length - 1) == Arrays.stream(array).min().getAsInt();
assert min(array) == Arrays.stream(array).min().getAsInt();
private FindMinRecursion() {
}
/**
* Get min of 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}
*/
public static int min(int[] array, int low, int high) {
public static int min(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]
}
@ -52,7 +27,7 @@ public class FindMinRecursion {
* @param len length of given array
* @return min value of {@code array}
*/
public static int min(int[] array) {
return array.length == 1 ? array[0] : min(array, 0, array.length);
public static int min(final int[] array) {
return min(array, 0, array.length - 1);
}
}