

import numpy as np







def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE						,  SCREAMING_SNAKE_CASE										=a.shape
     SCREAMING_SNAKE_CASE										=min(lowerCAmelCase_,   lowerCAmelCase_      )
     SCREAMING_SNAKE_CASE										=np.eye(lowerCAmelCase_      )
     SCREAMING_SNAKE_CASE										=a.copy()

     for k in range(t - 1      ):
          # select a column of modified matrix A':
          SCREAMING_SNAKE_CASE										=r[k:, [k]]
          # construct first basis vector
          SCREAMING_SNAKE_CASE										=np.zeros_like(lowerCAmelCase_      )
          SCREAMING_SNAKE_CASE										=1.0
          # determine scaling factor
          SCREAMING_SNAKE_CASE										=np.linalg.norm(lowerCAmelCase_      )
          # construct vector v for Householder reflection
          SCREAMING_SNAKE_CASE										=x + np.sign(x[0]      ) * alpha * ea
          v /= np.linalg.norm(lowerCAmelCase_      )

          # construct the Householder matrix
          SCREAMING_SNAKE_CASE										=np.eye(m - k      ) - 2.0 * v @ v.T
          # pad with ones and zeros as necessary
          SCREAMING_SNAKE_CASE										=np.block([[np.eye(lowerCAmelCase_      ), np.zeros((k, m - k)      )], [np.zeros((m - k, k)      ), q_k]]      )

          SCREAMING_SNAKE_CASE										=q @ q_k.T
          SCREAMING_SNAKE_CASE										=q_k @ r

     return q, r


if __name__ == "__main__":
 import doctest

 doctest.testmod()




def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=len(lowerCAmelCase_      )
     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)
                    SCREAMING_SNAKE_CASE										=lst[j + 1]
                    SCREAMING_SNAKE_CASE										=lst[j]
                    SCREAMING_SNAKE_CASE										=temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 1 - j]
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 2 - j]
                    SCREAMING_SNAKE_CASE										=temp
     return lst


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

