Simple BogoSort implementation

 1from datetime import timedelta
 2from random import shuffle
 3from time import time
 4
 5def check_sort(ar):
 6    for i in range(len(ar) - 1):
 7        if ar[i] > ar[i + 1]:
 8            return False
 9        
10    return True
11
12def bogo_sort(ar):
13
14    is_sorted = False
15    while not is_sorted:
16        is_sorted = check_sort(ar)
17        
18        if is_sorted:
19            return ar
20
21        # Note that for even rather small len(ar), the total number of permutations of ar 
22        # is larger than the period of most random number generators; this implies that 
23        # most permutations of a long sequence can never be generated [from the Python Docs]
24        # What this means is that the algorithm may get stuck after a given array length
25        shuffle(ar)
26
27    return ar
28
29if __name__ == '__main__':
30    
31    start = time()
32    print 'Sorting 1,2,3 ->', bogo_sort([1,2,3]), timedelta(seconds = time() - start)
33    
34    start = time()
35    print 'Sorting 3,2,1 ->', bogo_sort([3,2,1]), timedelta(seconds = time() - start)
36    
37    start = time()
38    print 'Sorting 3,4,5,6,7,1 ->', bogo_sort([3,4,5,6,7,1]), timedelta(seconds = time() - start)
39