mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-30 16:31:08 +00:00
Refactor gdc and rename two files GreaterCommonDivisor and FibonnaciSequenceRecursive
This commit is contained in:
parent
e03426b8fd
commit
1a4962a589
15
Maths/GreaterCommonDivisor.py
Normal file
15
Maths/GreaterCommonDivisor.py
Normal file
|
@ -0,0 +1,15 @@
|
||||||
|
# Greater Common Divisor - https://en.wikipedia.org/wiki/Greatest_common_divisor
|
||||||
|
def gcd(a, b):
|
||||||
|
return b if a == 0 else gcd(b % a, a)
|
||||||
|
|
||||||
|
def main():
|
||||||
|
try:
|
||||||
|
nums = input("Enter two Integers separated by comma (,): ").split(',')
|
||||||
|
num1 = int(nums[0]); num2 = int(nums[1])
|
||||||
|
except (IndexError, UnboundLocalError, ValueError):
|
||||||
|
print("Wrong Input")
|
||||||
|
print(f"gcd({num1}, {num2}) = {gcd(num1, num2)}")
|
||||||
|
|
||||||
|
if __name__ == '__main__':
|
||||||
|
main()
|
||||||
|
|
12
Maths/gcd.py
12
Maths/gcd.py
|
@ -1,12 +0,0 @@
|
||||||
def gcd(a, b):
|
|
||||||
if a == 0 :
|
|
||||||
return b
|
|
||||||
|
|
||||||
return gcd(b%a, a)
|
|
||||||
|
|
||||||
def main():
|
|
||||||
print(gcd(3, 6))
|
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
|
||||||
main()
|
|
Loading…
Reference in New Issue
Block a user