Update gcd.c

randerson112358 · web-flow · commit 4b907b4b9828 · 2019-01-20T03:08:17.000-05:00
diff --git a/gcd.c b/gcd.c
@@ -50,9 +50,9 @@ int gcd(int a, int b)
          a = b;
          b = temp;
     }
-    //Base Case is when a equals 0, this tells we are done
+    //Base Case is when a equals 0, this tells we are done (From:"Keep repeating the step until one of the two numbers reaches zero")
     if(a == 0)
       return b;
-    else // Else return our recursive case
+    else // Else return our recursive case (From: repeatedly replace the larger number with the greater number mod the lesser number)
       return gcd(a, b%a);
 }

Original file line number	Diff line number	Diff line change
`@@ -50,9 +50,9 @@ int gcd(int a, int b)`
`50`	`50`	`a = b;`
`51`	`51`	`b = temp;`
`52`	`52`	`}`
`53`		`- //Base Case is when a equals 0, this tells we are done`
	`53`	`+ //Base Case is when a equals 0, this tells we are done (From:"Keep repeating the step until one of the two numbers reaches zero")`
`54`	`54`	`if(a == 0)`
`55`	`55`	`return b;`
`56`		`- else // Else return our recursive case`
	`56`	`+ else // Else return our recursive case (From: repeatedly replace the larger number with the greater number mod the lesser number)`
`57`	`57`	`return gcd(a, b%a);`
`58`	`58`	`}`