From 3558a24b47b4cc1d8b7b8a3be7d415687085888b Mon Sep 17 00:00:00 2001 From: Camden Dixie O'Brien Date: Mon, 11 Dec 2023 16:09:45 +0000 Subject: [PATCH] Add note about Euclid's algorithm to greatest_common_divisior.lua --- greatest_common_divisor.lua | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/greatest_common_divisor.lua b/greatest_common_divisor.lua index 9d475cc..bc6dd16 100644 --- a/greatest_common_divisor.lua +++ b/greatest_common_divisor.lua @@ -1,6 +1,8 @@ --- The greatest common divisor (GCD) of two numbers X and Y is, as the --- name suggests, the largest number which evenly divides both X and --- Y. Implement the function below to calculate this. +-- The greatest common divisor (GCD) of two numbers is, as the name +-- suggests, the largest number which evenly divides both. Implement +-- the function below to calculate this. It's recommended that you +-- use Euclid's algorithm but feel free to use another approach if you +-- want. -- -- Solution -------------------------------------------------------------------- function greatest_common_divisor(x, y)