Codility lesson implementation.

Author: anitsh

codility/12.euclidean-algorithm/1.lesson/README.md

@@ -0,0 +1,8 @@
+# Theory Implementation
+
+Euclidean algorithm
+
+It solves the problem of computing the greatest common divisor (gcd) of two positive
+integers
+
+lcm(a, b) = a·b / gcd(a,b)

codility/12.euclidean-algorithm/1.lesson/solution.go

@@ -0,0 +1,25 @@
+package solution
+
+// Returns greatest common divisor of a and b
+func gcd(a, b, res int) int {
+
+	if a == b {
+		return res * a
+
+	} else if (a%2 == 0) && (b%2 == 0) {
+		return gcd(a/2, b/2, 2*res)
+
+	} else if a%2 == 0 {
+		return gcd(a/2, b, res)
+
+	} else if b%2 == 0 {
+		return gcd(a, b/2, res)
+
+	} else if a > b {
+		return gcd(a-b, b, res)
+
+	} else {
+		return gcd(a, b-a, res)
+	}
+
+}

codility/12.euclidean-algorithm/1.lesson/solution_test.go

@@ -0,0 +1,19 @@
+package solution
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestSeieve(t *testing.T) {
+	for k, test := range gcdData[:] {
+		fmt.Printf("k %v | test %v\n", k, test.description)
+
+		if got := gcd(test.a, test.b, 1); got != test.want {
+			t.Fatalf("FAIL: %s \n n: %#v got %v : want %v\n",
+				test.description, test.a, got, test.want)
+		}
+
+		// t.Logf("SUCCESS: %s", test.description)
+	}
+}

codility/12.euclidean-algorithm/1.lesson/test_cases.go

@@ -0,0 +1,32 @@
+package solution
+
+var gcdData = []struct {
+	description string
+	a           int
+	b           int
+	want        int
+	err         string
+}{
+	{
+		description: "GCD of 2 and 6",
+		a:           2,
+		b:           6,
+		want:        2,
+		err:         "",
+	},
+	{
+		description: "GCD of 2 and 4",
+		a:           2,
+		b:           4,
+		want:        2,
+		err:         "",
+	},
+
+	{
+		description: "GCD of 1 and 5",
+		a:           5,
+		b:           1,
+		want:        1,
+		err:         "",
+	},
+}

codility/12.euclidean-algorithm/2.chocolates-by-numbers/README.md

@@ -0,0 +1,8 @@
+# Theory Implementation
+
+Euclidean algorithm
+
+It solves the problem of computing the greatest common divisor (gcd) of two positive
+integers
+
+lcm(a, b) = a·b / gcd(a,b)

codility/12.euclidean-algorithm/2.chocolates-by-numbers/solution.go

@@ -0,0 +1,25 @@
+package solution
+
+// Returns greatest common divisor of a and b
+func gcd(a, b, res int) int {
+
+	if a == b {
+		return res * a
+
+	} else if (a%2 == 0) && (b%2 == 0) {
+		return gcd(a/2, b/2, 2*res)
+
+	} else if a%2 == 0 {
+		return gcd(a/2, b, res)
+
+	} else if b%2 == 0 {
+		return gcd(a, b/2, res)
+
+	} else if a > b {
+		return gcd(a-b, b, res)
+
+	} else {
+		return gcd(a, b-a, res)
+	}
+
+}

codility/12.euclidean-algorithm/2.chocolates-by-numbers/solution_test.go

@@ -0,0 +1,19 @@
+package solution
+
+import (
+	"fmt"
+	"testing"
+)
+
+func TestSeieve(t *testing.T) {
+	for k, test := range gcdData[:] {
+		fmt.Printf("k %v | test %v\n", k, test.description)
+
+		if got := gcd(test.a, test.b, 1); got != test.want {
+			t.Fatalf("FAIL: %s \n n: %#v got %v : want %v\n",
+				test.description, test.a, got, test.want)
+		}
+
+		// t.Logf("SUCCESS: %s", test.description)
+	}
+}

codility/12.euclidean-algorithm/2.chocolates-by-numbers/test_cases.go

@@ -0,0 +1,32 @@
+package solution
+
+var gcdData = []struct {
+	description string
+	a           int
+	b           int
+	want        int
+	err         string
+}{
+	{
+		description: "GCD of 2 and 6",
+		a:           2,
+		b:           6,
+		want:        2,
+		err:         "",
+	},
+	{
+		description: "GCD of 2 and 4",
+		a:           2,
+		b:           4,
+		want:        2,
+		err:         "",
+	},
+
+	{
+		description: "GCD of 1 and 5",
+		a:           5,
+		b:           1,
+		want:        1,
+		err:         "",
+	},
+}