Euclid algorithm in lolcode (#469)

Author: Julian

.editorconfig

@@ -80,6 +80,11 @@ indent_size = 2
 indent_style = space
 indent_size = 2
 
+# LOLCODE
+[*.lol]
+indent_style = space
+indent_size = 4
+
 # Matlab
 [*.m]
 indent_style = space

book.json

@@ -155,6 +155,10 @@
         {
           "lang": "emojic",
           "name": "Emojicode"
+        },
+        {
+          "lang": "lolcode",
+          "name": "LOLCODE"
         }
       ]
     }

contents/euclidean_algorithm/code/lolcode/euclid.lol

@@ -0,0 +1,47 @@
+HAI 1.2
+    HOW IZ I ABZ YR NUM
+        DIFFRINT NUM AN BIGGR OF NUM AN 0, O RLY?
+            YA RLY, FOUND YR DIFF OF 0 AN NUM
+            NO WAI, FOUND YR NUM
+        OIC
+    IF U SAY SO
+
+    HOW IZ I UKLIDMOD YR NUM1 AN YR NUM2
+        NUM1 R I IZ ABZ YR NUM1 MKAY
+        NUM2 R I IZ ABZ YR NUM2 MKAY
+
+        IM IN YR LOOP 
+            BOTH SAEM NUM2 AN 0, O RLY?
+                YA RLY, FOUND YR NUM1
+            OIC
+
+            I HAS A TMP ITZ NUM2
+            NUM2 R MOD OF NUM1 AN NUM2
+            NUM1 R TMP
+        IM OUTTA YR LOOP
+
+    IF U SAY SO
+
+    HOW IZ I UKLIDSUP YR NUM1 AN YR NUM2
+        NUM1 R I IZ ABZ YR NUM1 MKAY
+        NUM2 R EI IZ ABZ YR NUM2 MKAY
+
+        IM IN YR LOOP 
+            BOTH SAEM NUM1 AN NUM2, O RLY?
+                YA RLY, FOUND YR NUM1
+            OIC        
+
+            DIFFRINT NUM1 AN SMALLR OF NUM1 AN NUM2, O RLY?
+                YA RLY, NUM1 R DIFF OF NUM1 AN NUM2
+                NO WAI, NUM2 R DIFF OF NUM2 AN NUM1
+            OIC
+        IM OUTTA YR LOOP
+
+    IF U SAY SO
+
+    I HAS A CHECK1 ITZ I IZ UKLIDMOD YR PRODUKT OF 64 AN 67 AN YR PRODUKT OF 64 AN 81 MKAY
+    I HAS A CHECK2 ITZ I IZ UKLIDSUP YR PRODUKT OF 128 AN 12  AN YR PRODUKT OF 128 AN 77 MKAY
+
+    VISIBLE CHECK1
+    VISIBLE CHECK2
+KTHXBYE

contents/euclidean_algorithm/euclidean_algorithm.md

@@ -51,6 +51,8 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 [import:8-19, lang="ruby"](code/ruby/euclidean.rb)
 {% sample lang="st" %}
 [import:1-13, lang="smalltalk"](code/smalltalk/euclid.st)
+{% sample lang="lolcode" %}
+[import:25-40, lang="LOLCODE"](code/lolcode/euclid.lol)
 {% endmethod %}
 
 Here, we simply line the two numbers up every step and subtract the lower value from the higher one every timestep. Once the two values are equal, we call that value the greatest common divisor. A graph of `a` and `b` as they change every step would look something like this:
@@ -108,6 +110,8 @@ Modern implementations, though, often use the modulus operator (%) like so
 [import:1-6, lang="ruby"](code/ruby/euclidean.rb)
 {% sample lang="st" %}
 [import:15-25, lang="smalltalk"](code/smalltalk/euclid.st)
+{% sample lang="lolcode" %}
+[import:9-23, lang="LOLCODE"](code/lolcode/euclid.lol)
 {% endmethod %}
 
 Here, we set `b` to be the remainder of `a%b` and `a` to be whatever `b` was last timestep. Because of how the modulus operator works, this will provide the same information as the subtraction-based implementation, but when we show `a` and `b` as they change with time, we can see that it might take many fewer steps:
@@ -173,9 +177,10 @@ and modulo method:
 [import, lang="ruby"](code/ruby/euclidean.rb)
 {% sample lang="st" %}
 [import, lang="smalltalk"](code/smalltalk/euclid.st)
+{% sample lang="lolcode" %}
+[import, lang="LOLCODE"](code/lolcode/euclid.lol)
 {% endmethod %}
 
-
 <script>
 MathJax.Hub.Queue(["Typeset",MathJax.Hub]);
 </script>