From a55d5b3ea66a7ceb22f842063e1d9f633f90fb18 Mon Sep 17 00:00:00 2001 From: atomiks Date: Fri, 5 Jan 2018 00:40:42 +1100 Subject: [PATCH] Update gcd.md --- snippets/gcd.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/snippets/gcd.md b/snippets/gcd.md index 34e5635cd..39ab41b6e 100644 --- a/snippets/gcd.md +++ b/snippets/gcd.md @@ -2,7 +2,7 @@ Calculates the greatest common divisor between two or more numbers/arrays. -The inner `_gcd `function uses recursion. +The inner `_gcd` function uses recursion. Base case is when `y` equals `0`. In this case, return `x`. Otherwise, return the GCD of `y` and the remainder of the division `x/y`.