Improved JavaScript implementation of Euclidean

Author: Butt4cak3

contents/euclidean_algorithm/code/javascript/euclidean_example.js

@@ -1,32 +1,31 @@
-function euclid_mod(a, b){
-    a = Math.abs(a);
-    b = Math.abs(b);
+function euclidMod(a, b) {
+  a = Math.abs(a);
+  b = Math.abs(b);
 
-    var temp;
-    while (b != 0){
-        temp = b;
-        b = a%b;
-        a = temp;
-    }
+  let temp;
+  while (b !== 0) {
+    temp = b;
+    b = a % b;
+    a = temp;
+  }
 
-    return a;
+  return a;
 }
 
-function euclid_sub(a, b){
-    a = Math.abs(a);
-    b = Math.abs(b);
+function euclidSub(a, b) {
+  a = Math.abs(a);
+  b = Math.abs(b);
 
-    while (a != b){
-        if (a > b){
-            a = a - b;
-        }
-        else{
-            b = b - a;
-        }
+  while (a !== b) {
+    if (a > b) {
+      a -= a - b;
+    } else {
+      b = b - a;
     }
+  }
 
-    return a;
+  return a;
 }
 
-console.log(euclid_mod(64*67, 64*81));
-console.log(euclid_sub(128*12, 128*77));
+console.log(euclidMod(64 * 67, 64 * 81));
+console.log(euclidSub(128 * 12, 128 * 77));