From 43f04475e4f20217c26ad4870b587c69dad33070 Mon Sep 17 00:00:00 2001 From: Eric Berquist Date: Sun, 17 Oct 2021 17:30:09 -0400 Subject: [PATCH] Change Racket lang include from lisp to racket --- contents/euclidean_algorithm/euclidean_algorithm.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/contents/euclidean_algorithm/euclidean_algorithm.md b/contents/euclidean_algorithm/euclidean_algorithm.md index 82aa64a2a..f44c3acb7 100644 --- a/contents/euclidean_algorithm/euclidean_algorithm.md +++ b/contents/euclidean_algorithm/euclidean_algorithm.md @@ -56,7 +56,7 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two {% sample lang="scala" %} [import:3-8, lang="scala"](code/scala/euclidean.scala) {% sample lang="racket" %} -[import:3-14, lang="lisp"](code/racket/euclidean_algorithm.rkt) +[import:3-14, lang="racket"](code/racket/euclidean_algorithm.rkt) {% sample lang="ruby" %} [import:8-19, lang="ruby"](code/ruby/euclidean.rb) {% sample lang="st" %} @@ -146,7 +146,7 @@ Modern implementations, though, often use the modulus operator (%) like so {% sample lang="scala" %} [import:10-14, lang="scala"](code/scala/euclidean.scala) {% sample lang="racket" %} -[import:16-24, lang="lisp"](code/racket/euclidean_algorithm.rkt) +[import:16-24, lang="racket"](code/racket/euclidean_algorithm.rkt) {% sample lang="ruby" %} [import:1-6, lang="ruby"](code/ruby/euclidean.rb) {% sample lang="st" %} @@ -252,7 +252,7 @@ and modulo method: {% sample lang="scala" %} [import, lang="scala"](code/scala/euclidean.scala) {% sample lang="racket" %} -[import, lang="lisp"](code/racket/euclidean_algorithm.rkt) +[import, lang="racket"](code/racket/euclidean_algorithm.rkt) {% sample lang="ruby" %} [import, lang="ruby"](code/ruby/euclidean.rb) {% sample lang="st" %}