Added maths folder and an algorithm (Issue # 48) (Asiatik#54)

* Added Euclidean Algorithm

* Added Eucledian algorithm

Maths/Euclidean Algorithm/C++/GCD.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+
+//Using template here to support both long and ints.
+template <class integer>
+integer gcd(integer a, integer b)
+{
+    if (a == 0 || b == 0)
+    {
+        return a + b;
+    }
+    return gcd(b, b % a);
+}
+
+int main( int argv,char* argc[] )
+{
+    std::cout << gcd (100,10) << std::endl;
+    std::cout << gcd (-100,10) << std::endl;
+    std::cout << gcd (3,1) << std::endl;
+    std::cout << gcd(3L,1L);
+}

Maths/Euclidean Algorithm/C/GCD.c

@@ -0,0 +1,16 @@
+#include "stdio.h"
+
+//You should probably function overload to support longs as well.
+int gcd(int a, int b)
+{
+    if (a==0 || b==0)
+    {
+        return a + b;
+    }
+    return gcd(b, b % a); 
+}
+
+int main(int argc, char* argv[])
+{
+    printf("%d\n%d\n%d",gcd(100,10),gcd(100,-10),gcd(3,7));
+}

Maths/Euclidean Algorithm/Java/GCD.java

@@ -0,0 +1,12 @@
+public class GCD{
+
+    public static int gcd(int a, int b){
+        if ( a==0 || b==0){
+            return a+b;
+        }
+        return gcd(b, b % a)
+    }
+
+    public static void main(String args[]){
+    }
+}

Maths/Euclidean Algorithm/Python/GCD.py

@@ -0,0 +1,9 @@
+#Using python3
+def gcd(a, b):
+    if a == 0 or b == 0:
+        return a + b
+    return gcd(b, a % b)
+
+if __name__=='__main__':
+    print (gcd(10,100))
+    print (gcd(9,145))

Maths/Euclidean Algorithm/README.md

@@ -0,0 +1,15 @@
+# Euclidean Algorithm
+
+[Wikipedia Entry](https://en.wikipedia.org/wiki/Euclidean_algorithm)
+
+This is one of the fastest method for finding the greatest common divisior between two numbers.
+
+
+## Pseudocode
+
+    function gcd(a, b)
+        while b ≠ 0
+           t := b; 
+           b := a mod b; 
+           a := t; 
+        return a;