import random 
def bogosort(l):
	while not reduce(lambda x,y:x and y,[l[n]<=l[n+1]for n in range(len(l)-1)]):
		random.shuffle(l)
	return l

print(bogosort([1, 5, 3, 2, 7, 2]))

[1, 2, 2, 3, 5, 7]