


import unittest

from transformers import is_torch_available, load_tool

from .test_tools_common import ToolTesterMixin


if is_torch_available():
    import torch







class      _lowercase					(				unittest.TestCase				,    lowercase__):


       """simple docstring"""




       def 		lowerCAmelCase	(  self				:     Optional[int]			):


             '''simple docstring'''



             lowerCamelCase__						:							Optional[Any]       =    load_tool("speech-to-text"			)
             self.tool.setup()





       def 		lowerCAmelCase	(  self				:     Any			):


             '''simple docstring'''



             lowerCamelCase__						:							Optional[int]       =    self.tool(torch.ones(3000			)			)
             self.assertEqual(__lowerCamelCase   , " you"			)





       def 		lowerCAmelCase	(  self				:     List[str]			):


             '''simple docstring'''



             lowerCamelCase__						:							Optional[Any]       =    self.tool(audio=torch.ones(3000			)			)
             self.assertEqual(__lowerCamelCase   , " you"			)






def  lowercase_						(						_A     :       Dict		):

      """simple docstring"""




      lowerCamelCase__						:							Optional[Any]       =    len(_A		)
      for _ in range(
          0       ,   int(((no_of_elements - 1) / 2) + 1		)		):  # we don't need to traverse to end of list as
            for j in range(0       ,   no_of_elements - 1		):
                  if (
                      lst[j + 1] < lst[j]
                  ):  # applying bubble sort algorithm from left to right (or forwards)
                        lowerCamelCase__						:							Tuple       =    lst[j + 1]
                        lowerCamelCase__						:							Optional[Any]       =    lst[j]
                        lowerCamelCase__						:							Optional[Any]       =    temp
                  if (
                      lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
                  ):  # applying bubble sort algorithm from right to left (or backwards)
                        lowerCamelCase__						:							Any       =    lst[no_of_elements - 1 - j]
                        lowerCamelCase__						:							List[str]       =    lst[no_of_elements - 2 - j]
                        lowerCamelCase__						:							str       =    temp
      return lst


if __name__ == "__main__":
    print("enter the list to be sorted")
    A :       Optional[int]						=   [int(x) for x in input().split()]  # inputing elements of the list in one line
    A :       Optional[Any]						=   double_sort(lst)
    print("the sorted list is")
    print(sorted_lst)


