

'''simple docstring'''



def   lowerCamelCase__       (      a__)		->    list:



    """simple docstring"""







    _snake_case : str												=		len(a__)

    # Set the gap value to be decreased by a factor of 1.3
    # after each iteration
    _snake_case : List[Any]												=		1.3

    # Continue sorting until the gap is 1
    while gap > 1:
        # Decrease the gap value
        _snake_case : Tuple												=		int(gap / shrink)

        # Sort the elements using insertion sort
        for i in range(a__			,      len(a__)):
            _snake_case : Any												=		collection[i]
            _snake_case : List[str]												=		i
            while j >= gap and collection[j - gap] > temp:
                _snake_case : str												=		collection[j - gap]
                j -= gap
            _snake_case : Tuple												=		temp

    return collection


if __name__ == "__main__":
   import doctest

   doctest.testmod()






'''simple docstring'''



from __future__ import annotations

def   lowerCamelCase__       (      a__)		->    int | float:



    """simple docstring"""







    _snake_case : int												=		sorted(a__)
    _snake_case : List[str]												=		len(a__)
    _snake_case : Union[str, Any]												=		length >> 1
    return (
        (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
        if length % 2 == 0
        else sorted_list[mid_index]
    )

def   lowerCamelCase__       (      )		->    Union[str, Any]:



    """simple docstring"""







    import doctest

    doctest.testmod()


if __name__ == "__main__":
   main()



