Bogosort Implementation with Python Numpy 0

 1from numpy.random import shuffle as n_shuffle
 2from numpy import array
 3def bogosort(my_array):
 4
 5    # Let's make a local-scope-only array of the proper type.
 6    # This may add a little unfair overhead to comparisons,
 7    # but the value of type-normalization is generally self-evident.
 8    a = array(my_array)    
 9
10
11    s = a.size -1
12
13    if s <= 0:
14        return a
15
16    itr = xrange(s)
17
18    while True:
19        for x in itr:
20            if a[x] > a[x+1]:
21                break
22        else:
23            return a
24
25        n_shuffle(a)