



'''simple docstring'''


def 				__lowerCamelCase				(   A__    ,						A__    )       ->	list:






   """simple docstring"""
   UpperCamelCase					=  len(A__    )
   UpperCamelCase					=  []
   for i in range(len(A__    ) - pat_len + 1    ):
      UpperCamelCase					=  True
      for j in range(A__    ):
         if s[i + j] != pattern[j]:
            UpperCamelCase					=  False
            break
      if match_found:
         position.append(A__    )
   return position


if __name__ == "__main__":
   assert naive_pattern_search("ABCDEFG", "DE") == [3]
   print(naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC"))


'''simple docstring'''




def 	UpperCamelCase_							(					_UpperCAmelCase  :      list    )    ->    list:


       """simple docstring"""







       _UpperCAmelCase     :  List[Any]							      =    len(_UpperCAmelCase    )
       for _ in range(_UpperCAmelCase    ):
              for i in range(_ % 2			,	arr_size - 1			,	2    ):
                     if arr[i + 1] < arr[i]:
                            _UpperCAmelCase      ,  _UpperCAmelCase     :  int							      =    arr[i + 1], arr[i]

       return arr


if __name__ == "__main__":
  __SCREAMING_SNAKE_CASE       :     Optional[Any]     =  list(range(10, 0, -1))
  print(F'Original: {arr}. Sorted: {odd_even_transposition(arr)}')

