






def 		_a					(   a				:list			,							a				:int				)							->    int:
 for index, item in enumerate(a				):
  if item == target:
   return index
 return -1
def 		_a					(   a				:list			,							a				:int			,							a				:int			,							a				:int				)							->    int:
 if not (0 <= high < len(a				) and 0 <= low < len(a				)):
  raise Exception('''Invalid upper or lower bound!'''				)
 if high < low:
  return -1
 if sequence[low] == target:
  return low
 if sequence[high] == target:
  return high
 return rec_linear_search(a			,							low + 1			,							high - 1			,							a				)


if __name__ == "__main__":
     UpperCAmelCase__            =	input("Enter numbers separated by comma:\n").strip()
     UpperCAmelCase__            =	[int(item.strip()) for item in user_input.split(",")]

     UpperCAmelCase__            =	int(input("Enter a single number to be found in the list:\n").strip())
     UpperCAmelCase__            =	linear_search(sequence, target)
     if result != -1:
          print(f"""linear_search({sequence}, {target}) = {result}""")
     else:
          print(f"""{target} was not found in {sequence}""")










def 		_a					(   a				:list				)							->    list:
 for i, _ in enumerate(a				):
  if (i % 2 == 1) == (nums[i - 1] > nums[i]):
   a						,  a							=   nums[i], nums[i - 1]

 return nums


if __name__ == "__main__":
     print("Enter the array elements:")
     UpperCAmelCase__            =	list(map(int, input().split()))
     print("The unsorted array is:")
     print(array)
     print("Array after Wiggle sort:")
     print(wiggle_sort(array))


