mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-21 02:53:15 +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:
@ -1,15 +1,15 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
/**
|
||||
* This is Euclid's algorithm which is used to find the greatest common
|
||||
* denominator Overide function name gcd
|
||||
* This is Euclid's algorithm, used to find the greatest common
|
||||
* denominator Override function name gcd
|
||||
*
|
||||
* @author Oskar Enmalm 3/10/17
|
||||
*/
|
||||
public class GCD {
|
||||
|
||||
/**
|
||||
* get greatest common divisor
|
||||
* get the greatest common divisor
|
||||
*
|
||||
* @param num1 the first number
|
||||
* @param num2 the second number
|
||||
|
Reference in New Issue
Block a user