최대공약수(GCD) 계산 알고리즘

[ks2colorworld]

https://www.youtube.com/watch?v=M2mcJvmYpWY&list=PLsMufJgu5933ZkBCHS7bQTx0bncjwi4PK&index=3&ab_channel=Chan-SuShin&t=987

[ks2colorworld]

반복문 알고리즘 개선을 위한 코드 비교 (강의 내용에서 언급)

• gcd1.py : https://github.com/ks2colorworld/Data-Structures-In-Python/commit/9b49cc7b371077250e7967a85b5e7996cb3ad62f#diff-dbf2718af6e9ab225fab4959326600c865b183a8286b062fc7185a59627f4205
• gcd2.py : https://github.com/ks2colorworld/Data-Structures-In-Python/commit/9b49cc7b371077250e7967a85b5e7996cb3ad62f#diff-4e3d174631c80690945ae4a7748ec2a1c93f46ec47bb5b85510ddcd0d4fb0bb4

  while a!=0 and b != 0:
-    if a>b: a=a-b
-    else: b=b-a
+    if a>b: a=a%b
+    else: b=b%a
    whileIndex += 1

[ks2colorworld]

• gcd1.py

  

• gcd2.py