Bubble Sort optimized implementation in Python

bubble_sort_optimized.py

def bubble_sort_optimized(array, decrescent=False):
    if len(array) <= 1:
            return array
        for x in range(len(array) - 1):
            swapped = False
            for y in range(len(array) - x - 1):
                if ((decrescent and array[y] < array[y + 1]) or
                        (not decrescent and array[y] > array[y + 1])):
                    array[y], array[y + 1] = array[y + 1], array[y]
                    swapped = True
            if not swapped:
                return array
        return array