input: Write a python function to sort a list of integers in ascending order using the selection sort algorithm.
  assert sort([45, 33, 38, 10, 49]) == [10, 33, 38, 45, 49]
  assert sort([5, 2, 9, 1, 5, 6]) == [1, 2, 5, 5, 6, 9]
  assert sort([20, 10, 30, 15, 25]) == [10, 15, 20, 25, 30]
output: def sort(arr):
      for i in range(len(arr)):
          min_idx = i
          for j in range(i+1, len(arr)):
              if arr[j] < arr[min_idx]:
                  min_idx = j
          arr[i], arr[min_idx] = arr[min_idx], arr[i]
      return arr