Slightly changed the .md file to fit the changes.

Author: Trashtalk217

contents/euclidean_algorithm/euclidean_algorithm.md

@@ -20,7 +20,7 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 {% sample lang="js" %}
 [import:15-29, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="lisp" %}
-[import:3-12, lang="lisp"](code/clisp/euclidean_algorithm.lisp)
+[import:3-13, lang="lisp"](code/clisp/euclidean_algorithm.lisp)
 {% sample lang="py" %}
 [import:11-22, lang="python"](code/python/euclidean_example.py)
 {% sample lang="haskell" %}
@@ -97,7 +97,7 @@ Modern implementations, though, often use the modulus operator (%) like so
 {% sample lang="js" %}
 [import:1-13, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="lisp" %}
-[import:13-17, lang="lisp"](code/clisp/euclidean_algorithm.lisp)
+[import:15-19, lang="lisp"](code/clisp/euclidean_algorithm.lisp)
 {% sample lang="py" %}
 [import:1-9, lang="python"](code/python/euclidean_example.py)
 {% sample lang="haskell" %}