algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: handle zeros in CoPrimeCheck (#1622)

Browse Source
This commit is contained in:
Piotr Idzik
2024-02-29 06:06:08 +01:00
committed by GitHub
parent a5945e37c2
commit 8734dfccf9
2 changed files with 8 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
Maths/CoPrimeCheck.js
View File

@ -9,14 +9,7 @@
is coprime with b.
*/
// Here we use a GetEuclidGCD method as a utility.
const GetEuclidGCD = (arg1, arg2) => {
let less = arg1 > arg2 ? arg2 : arg1
for (less; less >= 2; less--) {
if (arg1 % less === 0 && arg2 % less === 0) return less
}
return less
}
import { GetEuclidGCD } from './GetEuclidGCD'
// CoPrimeCheck function return the boolean in respect of the given number is co-prime or not.
/**
@ -26,15 +19,11 @@ const GetEuclidGCD = (arg1, arg2) => {
* @returns return correspond boolean value, if both number are co-prime return `true`, else return `false`.
*/
const CoPrimeCheck = (firstNumber, secondNumber) => {
// firstly, check that input is a number or not.
if (typeof firstNumber !== 'number' || typeof secondNumber !== 'number') {
throw new TypeError('Argument is not a number.')
}
/*
This is the most efficient algorithm for checking co-primes
if the GCD of both the numbers is 1 that means they are co-primes.
*/
return GetEuclidGCD(Math.abs(firstNumber), Math.abs(secondNumber)) === 1
return GetEuclidGCD(firstNumber, secondNumber) === 1
}
export { CoPrimeCheck }