algorithms-python/algorithms/sort/bogo_sort.py at master · ivan1911/algorithms-python · GitHub

32 lines (25 loc) · 740 Bytes

import random

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

arr_len = len(arr)

while i+1 < arr_len:

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

Expand file tree