Add gcd, lcm, primeDecomposition

snippets/go/gcd.snip

@@ -0,0 +1,18 @@
+
+
+snippet gcd
+  func gcd (a, b float64) float64 {
+    if a > b {
+      return _gcd(a, b)
+    }
+    return _gcd(b, a)
+  }
+
+
+  func _gcd (a, b float64) float64 {
+    if b != 0 {
+      return _gcd(b, math.Mod(a, b))
+    }
+    return a
+  }
+

snippets/go/lcm.snip

@@ -0,0 +1,23 @@
+
+
+snippet lcm
+  func gcd (a, b float64) float64 {
+    if a > b {
+      return _gcd(a, b)
+    }
+    return _gcd(b, a)
+  }
+
+
+  func _gcd (a, b float64) float64 {
+    if b != 0 {
+      return _gcd(b, math.Mod(a, b))
+    }
+    return a
+  }
+
+
+  func lcm (a, b float64) float64 {
+    return (a * b) / gcd(a, b)
+  }
+

snippets/go/minmax.snip

@@ -4,18 +4,16 @@ snippet max
   func max(a int, b int) int {
     if a > b {
       return a
-    } else {
-      return b
     }
+    return b
   }
 
 
 snippet min
   func min(a int, b int) int {
     if a < b {
       return a
-    } else {
-      return b
     }
+    return b
   }
 

snippets/go/prime_decomp.snip

@@ -0,0 +1,37 @@
+
+
+snippet prime_decomp
+  // PrimeFactorPair each factor and its frequency
+  type PrimeFactorPair struct {
+    f int
+    b int
+  }
+
+
+  // prime demonposition
+  func primeDecomp (base int) []PrimeFactorPair {
+    var result []PrimeFactorPair
+
+    for i := 2; i*i <= base; i++ {
+
+      if (base % i == 0) {
+        var cnt int
+
+        for base % i == 0 {
+          base /= i
+          cnt++
+        }
+
+        factor := PrimeFactorPair{i, cnt}
+        result = append(result, factor)
+      }
+
+    }
+
+    if (base > 1) {
+      factor := PrimeFactorPair{base, 1}
+      result = append(result, factor)
+    }
+
+    return result
+  }