def bigosort(unsorted):
    while True:
        random.shuffle(unsorted)
        for i in range(0, len(unsorted)-1):
            if unsorted[i] <= unsorted[i+1]:
                if i == len(unsorted)-2:
                    return unsorted
            else:
                break