Implement the Euclidean algorithm into a Python function in order to calculate the largest common divisor of two numbers.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def euclid(numA, numB): | |
| while numB != 0: | |
| numRem = numA % numB | |
| numA = numB | |
| numB = numRem | |
| return numA |
No comments:
Post a Comment