Added python bogosort

Author: VikingScientist

chapters/sorting_searching/bogo/bogo_sort.md

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

chapters/sorting_searching/bogo/code/python/bogo.py

@@ -0,0 +1,20 @@
+from __future__ import print_function
+import random
+
+
+def is_sorted(a):
+    for i in range(len(a)-1):
+        if a[i+1] < a[i]:
+            return False
+    return True
+
+
+def bogo_sort(a):
+    while not is_sorted(a):
+        random.shuffle(a)
+
+
+a = [1., 3, 2, 4]
+bogo_sort(a)
+print(a)
+

chapters/sorting_searching/bubble/bubble_sort.md

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

chapters/sorting_searching/bubble/code/python/bubblesort.py

@@ -1,6 +1,4 @@
-#!usr/bin/python3
-
-#import section
+from __future__ import print_function
 import random
 
 
@@ -12,12 +10,8 @@ def bubble_sort(array):
         array[j], array[j+1] = array[j+1], array[j] #swap elements in the list
 
 
-def main():
-  number = [random.randint(0, 10000) for _ in range(10)]
-  print("Before Sorting  {}".format(number))
-  bubble_sort(number)
-  print("After Sorting  {}".format(number))
-
 
-if __name__ == "__main__":
-  main()
+number = [random.randint(0, 1000) for _ in range(10)]
+print("Before Sorting  {}".format(number))
+bubble_sort(number)
+print("After Sorting   {}".format(number))