mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2026-03-13 15:21:15 +08:00
Add tests to Math (#423)
* Add prettier config * test: add test to check for absolute function * chore: es5 to es6 * test: add test to check mean function * test: add test for sum of digit * test: add test for factorial * test: add test for fibonnaci * test: add test for find HCF * test: add test for lcm * test: add gridget test * test: add test for mean square error * test: add test for modular binary exponentiation * test: add tests for palindrome * test: add test for pascals triangle * test: add tests for polynomial * test: add tests for prime check * test: add tests for reverse polish notation * test: add tests for sieve of eratosthenes * test: add tests for pi estimation monte carlo method * chore: move tests to test folder * chore: fix standardjs errors
This commit is contained in:
committed by
GitHub
parent
554abf7126
commit
e112434dee
@@ -4,7 +4,7 @@
|
||||
https://en.wikipedia.org/wiki/Greatest_common_divisor
|
||||
*/
|
||||
|
||||
function findHCF (x, y) {
|
||||
const findHCF = (x, y) => {
|
||||
// If the input numbers are less than 1 return an error message.
|
||||
if (x < 1 || y < 1) {
|
||||
return 'Please enter values greater than zero.'
|
||||
@@ -27,4 +27,5 @@ function findHCF (x, y) {
|
||||
// When the while loop finishes the minimum of x and y is the HCF.
|
||||
return Math.min(x, y)
|
||||
}
|
||||
console.log(findHCF(27, 36))
|
||||
|
||||
export { findHCF }
|
||||
|
||||
Reference in New Issue
Block a user