Merge pull request #2 from leios/johhnry_updates

adding processing visualization and small merges.

Author: johhnry

book.json

@@ -140,6 +140,26 @@
           "lang": "f90",
           "name": "Fortran90"
         },
+        {
+          "lang": "factor",
+          "name": "Factor"
+        },
+        {
+          "lang": "ws",
+          "name": "Whitespace"
+        },
+        {
+          "lang": "scala",
+          "name": "Scala"
+        },
+        {
+          "lang": "emojic",
+          "name": "Emojicode"
+        },
+        {
+          "lang": "lolcode",
+          "name": "LOLCODE"
+        },
         {
           "lang": "pde",
           "name": "Processing"

contents/bogo_sort/bogo_sort.md

@@ -43,6 +43,26 @@ In code, it looks something like this:
 [import:16-18, lang:"nim"](code/nim/bogo_sort.nim)
 {% sample lang="ruby" %}
 [import:12-16, lang:"ruby"](code/ruby/bogo.rb)
+{% sample lang="emojic" %}
+[import:2-6, lang:"emojicode"](code/emojicode/bogo_sort.emojic)
+{% sample lang="factor" %}
+[import:10-12, lang:"factor"](code/factor/bogo_sort.factor)
+{% sample lang="f90" %}
+[import:24-32, lang:"fortran"](code/fortran/bogo.f90)
+{% sample lang="racket" %}
+[import:3-8, lang:"lisp"](code/racket/bogo_sort.rkt)
+{% sample lang="st" %}
+[import:2-6, lang:"st"](code/smalltalk/bogosort.st)
+{% sample lang="bash" %}
+[import:38-45, lang:"bash"](code/bash/bogo_sort.bash)
+{% sample lang="asm-x64" %}
+[import:93-113, lang:"asm-x64"](code/asm-x64/bogo_sort.s)
+{% sample lang="lisp" %}
+[import:20-24, lang:"lisp"](code/clisp/bogo-sort.lisp)
+{% sample lang="crystal" %}
+[import:10-14, lang:"crystal"](code/crystal/bogo.cr)
+{% sample lang="r" %}
+[import:1-6, lang:"r"](code/r/bogo_sort.r)
 {% sample lang="pde" %}
 [import:55-59, lang:"java"](code/processing/bogoSort.pde)
 {% endmethod %}
@@ -51,6 +71,17 @@ That's it.
 Ship it!
 We are done here!
 
+Here's a visual representation of what's happening:
+
+<p>
+    <img  class="center" src="res/bogo.gif" width="500" />
+</p>
+
+
+You can check out the code for this visualization by changing the language to `Processing`.
+Here, we see that the array shuffles about at random until it eventually finds the correct result.
+Obviously, bogo sort is almost impossible with a large array.
+
 ## Example Code
 
 {% method %}
@@ -87,11 +118,30 @@ We are done here!
 [import, lang:"nim"](code/nim/bogo_sort.nim)
 {% sample lang="ruby" %}
 [import, lang:"ruby"](code/ruby/bogo.rb)
+{% sample lang="emojic" %}
+[import, lang:"emojicode"](code/emojicode/bogo_sort.emojic)
+{% sample lang="factor" %}
+[import, lang:"factor"](code/factor/bogo_sort.factor)
+{% sample lang="f90" %}
+[import, lang:"fortran"](code/fortran/bogo.f90)
+{% sample lang="racket" %}
+[import, lang:"lisp"](code/racket/bogo_sort.rkt)
+{% sample lang="st" %}
+[import, lang:"st"](code/smalltalk/bogosort.st)
+{% sample lang="bash" %}
+[import, lang:"bash"](code/bash/bogo_sort.bash)
+{% sample lang="asm-x64" %}
+[import, lang:"asm-x64"](code/asm-x64/bogo_sort.s)
+{% sample lang="lisp" %}
+[import, lang:"lisp"](code/clisp/bogo-sort.lisp)
+{% sample lang="crystal" %}
+[import, lang:"crystal"](code/crystal/bogo.cr)
+{% sample lang="r" %}
+[import, lang:"r"](code/r/bogo_sort.r)
 {% sample lang="pde" %}
 [import:1-53, lang:"java"](code/processing/bogoSort.pde)
 {% endmethod %}
 
-
 <script>
 MathJax.Hub.Queue(["Typeset",MathJax.Hub]);
 </script>