Added Processing language + BogoSort implementation

book.json

@@ -185,6 +185,10 @@
           "lang": "lolcode",
           "name": "LOLCODE"
         },
+        {
+          "lang": "pde",
+          "name": "Processing"
+        },
         {
           "lang": "piet",
           "name": "Piet"

contents/bogo_sort/bogo_sort.md

@@ -65,6 +65,8 @@ In code, it looks something like this:
 [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)
 {% sample lang="scala" %}
 [import:12-16, lang:"scala"](code/scala/bogo.scala)
 {% sample lang="go" %}
@@ -75,6 +77,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 %}
@@ -133,13 +146,14 @@ We are done here!
 [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)
 {% sample lang="scala" %}
 [import, lang:"scala"](code/scala/bogo.scala)
 {% sample lang="go" %}
 [import, lang:"go"](code/go/bogo_sort.go)
 {% endmethod %}
 
-
 <script>
 MathJax.Hub.Queue(["Typeset",MathJax.Hub]);
 </script>

contents/bogo_sort/code/processing/bogoSort.pde

@@ -0,0 +1,59 @@
+int[] test_array = new int[5];
+
+void setup() {
+  size(400,400);
+  stroke(255);
+  fill(0);
+
+  randomArray(test_array,0,100);
+}
+
+void draw(){
+  background(255);
+
+  int w = width/test_array.length , minimum = min(test_array) , maximum = max(test_array);
+  for(int i=0;i<test_array.length;i++){
+    rect(w*i,height,w,-map(test_array[i],minimum,maximum,5,height-5));
+  }
+
+  if (isSorted(test_array)){
+    noLoop();
+    println("Finished in "+ millis()/1000 +" seconds.");
+  }else{
+    randomize(test_array);
+  }
+}
+
+
+void randomArray(int[] array , int min , int max){
+  for(int i=0;i<array.length;i++){
+    array[i] = (int) random(min,max);
+  }
+}
+
+void swap(int[] array, int i, int j) {
+  int temp = array[i];
+  array[i] = array[j];
+  array[j] = temp;
+}
+
+
+void randomize(int[] array) {
+  for (int i = array.length-1; i>=1 ; i--) {
+    int j = (int) random(0, i);
+    swap(array,i,j);
+  }
+}
+
+Boolean isSorted(int[] array){
+  for(int i=0;i<array.length-1;i++){
+    if (array[i]>array[i+1]) return false;
+  }
+  return true;
+}
+
+void bogoSort(int[] array){
+  while (! isSorted(array)){
+    randomize(array);
+  }
+}