用欧几里得算法求解最大公约数

Author: shengshijun

README.md

@@ -39,6 +39,9 @@ algorithm
 ###斐波那契树
 1.  使用循环实现的算法o(n)
 
+##数论算法
+1.  欧几里得算法求解最大公约数
+
 
 #数据结构
 ------------

number_theory/__init__.py

@@ -0,0 +1,3 @@
+#!/usr/bin/env python
+# -*- coding:UTF-8
+__author__ = 'shenshijun'

number_theory/gcd.py

@@ -0,0 +1,20 @@
+#!/usr/bin/env python
+# -*- coding:UTF-8
+__author__ = 'shenshijun'
+
+
+def gcd(a, b):
+    divisor = a
+    dividend = b
+    while dividend is not 0:
+        divisor, dividend = dividend, divisor % dividend
+    return divisor
+
+
+def main():
+    print(gcd(12, 18))
+
+
+if __name__ == "__main__":
+    main()
+