mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-12-19 07:00:35 +08:00
Improved code readability and code quality (#4663)
* Fixed Small typos :-) * Update BufferedReader.java * Made the following changes : * Improved readability of files and removed gramatical errors. * Implemented data assigning instead of manually calling arr.ylength in several instances like FindMax, FindMaxRecursion etc. * Removed unwanted params from several files * Implemented Math methods in files math/FindMinRecursion.java and FindMaxRecursion.java * Update src/main/java/com/thealgorithms/maths/FindMinRecursion.java --------- Co-authored-by: Debasish Biswas <debasishbsws.dev@gmail.com>
This commit is contained in:
@@ -4,6 +4,16 @@ public final class FindMinRecursion {
|
||||
|
||||
private FindMinRecursion() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Get min 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 min of {@code array}
|
||||
*/
|
||||
|
||||
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.");
|
||||
@@ -17,14 +27,13 @@ public final class FindMinRecursion {
|
||||
int leftMin = min(array, low, mid); // get min in [low, mid]
|
||||
int rightMin = min(array, mid + 1, high); // get min in [mid+1, high]
|
||||
|
||||
return leftMin > rightMin ? rightMin : leftMin;
|
||||
return Math.min(leftMin, rightMin);
|
||||
}
|
||||
|
||||
/**
|
||||
* Get min of array using recursion algorithm
|
||||
* Get min of an array using recursion algorithm
|
||||
*
|
||||
* @param array contains elements
|
||||
* @param len length of given array
|
||||
* @return min value of {@code array}
|
||||
*/
|
||||
public static int min(final int[] array) {
|
||||
|
||||
Reference in New Issue
Block a user