fix, self-contained gcd method

suryapratapsinghsuryavanshi · suryapratapsinghsuryavanshi · commit 5e3106e81be4 · 2021-09-07T18:10:47.000+05:30
diff --git a/Maths/CoPrimeCheck.js b/Maths/CoPrimeCheck.js
@@ -9,8 +9,14 @@
     is coprime with b.
 */
 
-// Here we require an already implemented method.
-const GetEuclidGCD = require('./GetEuclidGCD')
+// 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)
+}
 
 // CoPrimeCheck function return the boolean in respect of the given number is co-prime or not.
 /**
