Selection Sort optimized implementation in Python

selection_sort_optimized.py

def selection_sort_optimized(array, decrescent=False):
    if len(array) <= 1:
        return array
    for x in range(len(array)):
        left_swap_index = x
        right_swap_index = x
        for y in range(x + 1, len(array) - x):
            if ((decrescent and array[y] > array[left_swap_index]) or
                    (not decrescent and array[y] < array[left_swap_index])):
                left_swap_index = y
            if ((decrescent and array[y] < array[right_swap_index]) or
                    (not decrescent and array[y] > array[right_swap_index])):
                right_swap_index = y
        array[x], array[left_swap_index] = array[left_swap_index], array[x]
        # If the right swap index wasn't changed from the initial value,
        # change it for the left swap index, as the left swap will change
        # the right swap target element position.
        if right_swap_index == x:
            right_swap_index = left_swap_index
        array[len(array) - x - 1], array[right_swap_index] = array[
            right_swap_index], array[len(array) - x - 1]
        # If the last outer loop comparisons were made in a subarray that
        # has a length of 1 or lower, no more outer loops are needed.
        if len(range(x + 1, len(array) - x)) <= 1:
            break
    return array