human
Complete this python program:
def bogosort(collection):
assistant
#Here is the Python program you requested.

    """Pure implementation of the bogosort algorithm in Python
    :param collection: some mutable ordered collection with heterogeneous
    comparable items inside
    :return: the same collection ordered by ascending
    Examples:
    >>> bogosort([0, 5, 3, 2, 2])
    [0, 2, 2, 3, 5]
    >>> bogosort([])
    >>> bogosort([-2, -5, -45])
    [-45, -5, -2]
    """
    def isSorted(collection):
        if (len(collection) < 2):
            return True
        for i in range((len(collection) - 1)):
            if (collection[i] > collection[(i + 1)]):
                return False
        return True
    while (not isSorted(collection)):
        random.shuffle(collection)
    return collection