added simulation to bogo_sort.py (keon#355)

algorithms/sort/bogo_sort.py

@@ -1,11 +1,16 @@
 import random
 
-def bogo_sort(arr):
+def bogo_sort(arr, simulation=False):
     """Bogo Sort
         Best Case Complexity: O(n)
         Worst Case Complexity: O(∞)
         Average Case Complexity: O(n(n-1)!)
     """
+
+    iteration = 0
+    if simulation:
+        print("iteration",iteration,":",*arr)
+
     def is_sorted(arr):
         #check the array is inorder
         i = 0
@@ -14,9 +19,14 @@ def is_sorted(arr):
             if arr[i] > arr[i+1]:
                 return False
             i += 1
+
+
         return True
     while not is_sorted(arr):
         random.shuffle(arr)
+
+        if simulation:
+            iteration = iteration + 1
+            print("iteration",iteration,":",*arr)
+
     return arr
-
-