Added Matlab bubblesort

book.json

@@ -83,6 +83,10 @@
 					"lang": "go",
 					"name": "Go"
 				}
+				{
+					"lang": "m",
+					"name": "Matlab"
+				}
 
 			],
 			"split": false

chapters/sorting_searching/bogo/bogo_sort.md

@@ -27,6 +27,8 @@ In code, it looks something like this:
 [import:1-16, lang:"javascript"](code/js/bogo.js)
 {% sample lang="hs" %}
 [import, lang:"haskell"](code/haskell/bogoSort.hs)
+{% sample lang="m" %}
+[import, lang:"matlab"](code/matlab/bogosort.m)
 {% sample lang="cpp" %}
 [import, lang:"c_cpp"](code/c++/bogosort.cpp)
 {% sample lang="rs" %}

chapters/sorting_searching/bogo/code/matlab/bogosort.m

@@ -0,0 +1,30 @@
+function main()
+    array = floor( rand(1,7)*100 );
+    disp('Before Sorting:')
+    disp(array)
+
+    array = bogo_sort(array);
+    disp('After Sorting')
+    disp(array)
+end
+
+function retval = is_sorted(array)
+    for i=1:length(array)-1
+        if array(i) > array(i+1)
+            retval = false;
+            return
+        end
+    end
+    retval = true;
+end
+
+function sorted_array = bogo_sort(array)
+    while ~is_sorted(array)
+        % create a list of random permutation indices
+        i = randperm(length(array));
+        array = array(i);
+    end
+    sorted_array = array;
+end
+
+

chapters/sorting_searching/bubble/bubble_sort.md

@@ -20,6 +20,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:1-11, lang:"javascript"](code/js/bubble.js)
 {% sample lang="py" %}
 [import:4-9, lang:"python"](code/python/bubblesort.py)
+{% sample lang="m" %}
+[import:11-23, lang:"matlab"](code/matlab/bubblesort.m)
 {% sample lang="hs" %}
 [import, lang:"haskell"](code/haskell/bubbleSort.hs)
 {% sample lang="cpp" %}

chapters/sorting_searching/bubble/code/matlab/bubblesort.m

@@ -0,0 +1,25 @@
+function main()
+    array = floor( rand(1,7)*100 );
+    disp('Before Sorting:')
+    disp(array)
+
+    array = bubble_sort(array);
+    disp('After Sorting')
+    disp(array)
+end
+
+function sorted_array = bubble_sort(array)
+    for i=1:length(array)
+        for j=1:length(array)-i
+            if array(j) > array(j+1)
+                % swap elements in the list
+                temp       = array(j);
+                array(j)   = array(j+1);
+                array(j+1) = temp;
+            end
+        end
+    end
+    sorted_array = array
+end
+
+