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 typing style

Browse Source
This commit is contained in:
Suryapratap Singh
2021-09-07 03:23:38 +05:30
parent 617ec6ba27
commit 7fb345b4bd
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Maths/CoPrimeCheck.js
View File

@ -20,10 +20,10 @@ const GetEuclidGCD = require('./GetEuclidGCD')
* @returns return correspond boolean value, if both number are co-prime return `true`, else return `false`. * @returns return correspond boolean value, if both number are co-prime return `true`, else return `false`.
*/ */
const CoPrimeCheck = (firstNumber, secondNumber) => { const CoPrimeCheck = (firstNumber, secondNumber) => {
// firstly, check that input is a number or not. // firstly, check that input is a number or not.
if (typeof firstNumber !== 'number' || typeof secondNumber !== 'number') { if (typeof firstNumber !== 'number' || typeof secondNumber !== 'number') {
return new TypeError('Argument is not a number.'); return new TypeError('Argument is not a number.')
} }
/* /*
This is the most efficient algorithm for checking co-primes 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. if the GCD of both the numbers is 1 that means they are co-primes.