



from __future__ import annotations



def 		lowerCAmelCase__    (					UpperCamelCase_				:       list ,       UpperCamelCase_				:       int	)->  List[Any]:
    # Checks if the entire collection has been sorted
    if len(UpperCamelCase_	) <= 1 or n <= 1:
        return

    insert_next(UpperCamelCase_ ,       n - 1	)
    rec_insertion_sort(UpperCamelCase_ ,       n - 1	)



def 		lowerCAmelCase__    (					UpperCamelCase_				:       list ,       UpperCamelCase_				:       int	)->  str:
    # Checks order between adjacent elements
    if index >= len(UpperCamelCase_	) or collection[index - 1] <= collection[index]:
        return

    # Swaps adjacent elements since they are not in ascending order
    A__ ,	A__		 =					(
        collection[index],
        collection[index - 1],
    )

    insert_next(UpperCamelCase_ ,       index + 1	)


if __name__ == "__main__":
   _lowercase						  =		input("Enter integers separated by spaces: ")
   _lowercase						  =		[int(num) for num in numbers.split()]
   rec_insertion_sort(number_list, len(number_list))
   print(number_list)





import numpy as np



def 		lowerCAmelCase__    (					UpperCamelCase_				:       np.array	)->  np.array:
    return 1 / (1 + np.exp(-vector	))



def 		lowerCAmelCase__    (					UpperCamelCase_				:       np.array	)->  np.array:
    return vector * sigmoid(1.702 * vector	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
