




from __future__ import annotations

# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
_lowerCamelCase      			=						10




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int	,					__UpperCamelCase      :						int	,					__UpperCamelCase      :						list[int]	,					__UpperCamelCase      :						int				)  ->							int:
    for i in range(lowerCAmelCase__	,					lowerCAmelCase__				):
        if array[i] == target:
            return i
    return -1




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						list[int]	,					__UpperCamelCase      :						int				)  ->							int:
    UpperCAmelCase_										=					0
    UpperCAmelCase_										=					len(lowerCAmelCase__				)
    while left <= right:
        if right - left < precision:
            return lin_search(lowerCAmelCase__	,					lowerCAmelCase__	,					lowerCAmelCase__	,					lowerCAmelCase__				)

        UpperCAmelCase_										=					(left + right) // 3 + 1
        UpperCAmelCase_										=					2 * (left + right) // 3 + 1

        if array[one_third] == target:
            return one_third
        elif array[two_third] == target:
            return two_third

        elif target < array[one_third]:
            UpperCAmelCase_										=					one_third - 1
        elif array[two_third] < target:
            UpperCAmelCase_										=					two_third + 1

        else:
            UpperCAmelCase_										=					one_third + 1
            UpperCAmelCase_										=					two_third - 1
    else:
        return -1




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int	,					__UpperCamelCase      :						int	,					__UpperCamelCase      :						list[int]	,					__UpperCamelCase      :						int				)  ->							int:
    if left < right:
        if right - left < precision:
            return lin_search(lowerCAmelCase__	,					lowerCAmelCase__	,					lowerCAmelCase__	,					lowerCAmelCase__				)
        UpperCAmelCase_										=					(left + right) // 3 + 1
        UpperCAmelCase_										=					2 * (left + right) // 3 + 1

        if array[one_third] == target:
            return one_third
        elif array[two_third] == target:
            return two_third

        elif target < array[one_third]:
            return rec_ternary_search(lowerCAmelCase__	,					one_third - 1	,					lowerCAmelCase__	,					lowerCAmelCase__				)
        elif array[two_third] < target:
            return rec_ternary_search(two_third + 1	,					lowerCAmelCase__	,					lowerCAmelCase__	,					lowerCAmelCase__				)
        else:
            return rec_ternary_search(one_third + 1	,					two_third - 1	,					lowerCAmelCase__	,					lowerCAmelCase__				)
    else:
        return -1


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 _lowerCamelCase      			=						input('Enter numbers separated by comma:\n').strip()
 _lowerCamelCase      			=						[int(item.strip()) for item in user_input.split(',')]
 assert collection == sorted(collection), F"List must be ordered.\n{collection}."
 _lowerCamelCase      			=						int(input('Enter the number to be found in the list:\n').strip())
 _lowerCamelCase      			=						ite_ternary_search(collection, target)
 _lowerCamelCase      			=						rec_ternary_search(0, len(collection) - 1, collection, target)
 if resulta != -1:
  print(F"Iterative search: {target} found at positions: {resulta}")
  print(F"Recursive search: {target} found at positions: {resulta}")
 else:
  print('Not found')












def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Optional[Any]				)  ->							Union[str, Any]:
    UpperCAmelCase_										=					len(__UpperCamelCase				)
    while cur > 1:
        # Find the maximum number in arr
        UpperCAmelCase_										=					arr.index(max(arr[0:cur]				)				)
        # Reverse from 0 to mi
        UpperCAmelCase_										=					arr[mi::-1] + arr[mi + 1 : len(__UpperCamelCase				)]
        # Reverse whole list
        UpperCAmelCase_										=					arr[cur - 1 :: -1] + arr[cur : len(__UpperCamelCase				)]
        cur -= 1
    return arr


if __name__ == "__main__":
 _lowerCamelCase      			=						input('Enter numbers separated by a comma:\n').strip()
 _lowerCamelCase      			=						[int(item) for item in user_input.split(',')]
 print(pancake_sort(unsorted))





