Skip to content

Implemented GCD function #161

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
BruceSiaNJIT wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Implemented GCD function #161

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions students_submissions/gcd_bns24.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
def gcd(a: int, b: int) -> int:
"""
Calculate the greatest common divisor (GCD) of two integers a and b
using the Euclidean algorithm.
"""
# Implement your solution here
if a == 0 and b == 0:
print("Error: Undefined.")
return None

if b == 0:
return abs(a) #gcd is never negative
return gcd(b, a%b)

# Test cases
print(gcd(54, 24)) # Expected output: 6
print(gcd(48, 18)) # Expected output: 6
print(gcd(101, 10)) # Expected output: 1
print(gcd(0, 0)) # Expected output: "Error: Undefined."
print(gcd(-36, 6)) # Expected output: 6
print(gcd(-36, -6)) # Expected output: 6
print(gcd(7, 11)) # Expected output: 1