mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-24 04:54:21 +08:00
@ -20,10 +20,8 @@ public class FindMinRecursion {
|
||||
array[i] = rand.nextInt() % 100;
|
||||
}
|
||||
|
||||
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, 0, array.length - 1) == Arrays.stream(array).min().getAsInt();
|
||||
assert min(array, array.length) == Arrays.stream(array).min().getAsInt();
|
||||
}
|
||||
|
||||
/**
|
||||
@ -55,8 +53,6 @@ public class FindMinRecursion {
|
||||
* @return min value of {@code array}
|
||||
*/
|
||||
public static int min(int[] array, int len) {
|
||||
return len == 1
|
||||
? array[0]
|
||||
: Math.min(min(array, len - 1), array[len - 1]);
|
||||
return len == 1 ? array[0] : Math.min(min(array, len - 1), array[len - 1]);
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user