Implementation of Euclideans Algorithm in Kotlin. (#589)

Author: olaven

CONTRIBUTORS.md

@@ -42,3 +42,4 @@ This file lists everyone, who contributed to this repo and wanted to show up her
 - Christopher Milan
 - Vexatos
 - Björn Heinrichs 
+- Olav Sundfør

contents/euclidean_algorithm/code/kotlin/Euclidean.kt

@@ -0,0 +1,31 @@
+import kotlin.math.absoluteValue
+
+fun euclidSub(a: Int, b: Int): Int {
+    var a = a.absoluteValue
+    var b = b.absoluteValue
+
+    while (a != b) {
+        if (a > b) a -= b
+        else b -= a
+    }
+
+    return a
+}
+
+fun euclidMod(a: Int, b: Int): Int {
+    var a = a.absoluteValue
+    var b = b.absoluteValue
+
+    while (b != 0) {
+        val tmp = b
+        b = a % b
+        a = tmp
+    }
+
+    return a
+}
+
+fun main(args: Array<String>) {
+    println(euclidSub(128 * 12, 128 * 77))
+    println(euclidMod(64 * 67, 64 * 81))
+}

contents/euclidean_algorithm/euclidean_algorithm.md

@@ -15,6 +15,8 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 [import:18-31, lang="c_cpp"](code/c++/euclidean.cpp)
 {% sample lang="java" %}
 [import:3-16, lang="java"](code/java/EuclideanAlgo.java)
+{% sample lang="kotlin" %}
+[import:3-13, lang="kotlin"](code/kotlin/Euclidean.kt)
 {% sample lang="js" %}
 [import:15-29, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="lisp" %}
@@ -88,6 +90,8 @@ Modern implementations, though, often use the modulus operator (%) like so
 [import:5-15, lang="c_cpp"](code/c++/euclidean.cpp)
 {% sample lang="java" %}
 [import:18-26, lang="java"](code/java/EuclideanAlgo.java)
+{% sample lang="kotlin" %}
+[import:15-26, lang="kotlin"](code/kotlin/Euclidean.kt)
 {% sample lang="js" %}
 [import:1-13, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="lisp" %}