Standardize javascript output

This also fixes a bug in the original implementation.

Author: stormofice

contents/euclidean_algorithm/code/coconut/euclidean.coco

@@ -15,5 +15,5 @@ addpattern def euclid_mod(0, b is int) = b
 addpattern def euclid_mod(a is int, b is int) = euclid_mod(b, a % b)
 
 if __name__ == '__main__':
-    print('Euclidean mod:', euclid_mod(64 * 67, 64 * 81))
-    print('Euclidean sub:', euclid_sub(128 * 12, 128 * 77))
+    print('[#]\nModulus-based euclidean algorithm result:\n', euclid_mod(64 * 67, 64 * 81))
+    print('[#]\nSubtraction-based euclidean algorithm result:\n', euclid_sub(128 * 12, 128 * 77))

contents/euclidean_algorithm/code/javascript/euclidean_example.js

@@ -18,14 +18,16 @@ function euclidSub(a, b) {
 
   while (a !== b) {
     if (a > b) {
-      a -= a - b;
+      a -= b;
     } else {
-      b = b - a;
+      b -= a;
     }
   }
 
   return a;
 }
 
+console.log('[#]\nModulus-based euclidean algorithm result:')
 console.log(euclidMod(64 * 67, 64 * 81));
+console.log('[#]\nSubtraction-based euclidean algorithm result:')
 console.log(euclidSub(128 * 12, 128 * 77));

contents/euclidean_algorithm/code/julia/euclidean.jl

@@ -28,8 +28,8 @@ function main()
     check1 = euclid_mod(64 * 67, 64 * 81);
     check2 = euclid_sub(128 * 12, 128 * 77);
 
-    println("Modulus-based euclidean algorithm result: $(check1)")
-    println("subtraction-based euclidean algorithm result: $(check2)")
+    println("[#]\nModulus-based euclidean algorithm result:\n$(check1)")
+    println("[#]\nSubtraction-based euclidean algorithm result:\n$(check2)")
 
 end
 

contents/euclidean_algorithm/code/python/euclidean_example.py

@@ -27,5 +27,5 @@ def euclid_sub(a, b):
     return a
 
 if __name__=="__main__":
-    print('Euclidean mod: ', euclid_mod(64 * 67, 64 * 81))
-    print('Euclidean sub: ', euclid_sub(128 * 12, 128 * 77))
+    print '[#]\nModulus-based euclidean algorithm result:\n', euclid_mod(64 * 67, 64 * 81)
+    print '[#]\nSubtraction-based euclidean algorithm result:\n', euclid_sub(128 * 12, 128 * 77)

contents/euclidean_algorithm/code/ruby/euclidean.rb

@@ -17,9 +17,8 @@ def gcd_minus(a, b)
 	end
 	a
 end
- 
-p gcd_mod(12 * 6, 12 * 4) #=> 12
-p gcd_mod(9 * 667, 9 * 104) #=> 9
 
-p gcd_minus(12 * 6, 12 * 4) #=> 12
-p gcd_minus(9 * 667, 9 * 104) #=> 9
+print "[#]\nModulus-based euclidean algorithm result:\n"
+p gcd_mod(64 * 67, 64 * 81)
+print "[#]\nSubtraction-based euclidean algorithm result:\n"
+p gcd_minus(128 * 12, 128 * 77)