input: def sort_ascending(nums: List[int]):
      """ Implements a sorting algorithm that takes a list of integers as input and outputs the list sorted in ascending order.
      >>> sort_ascending([3, 1, 4, 1, 5, 9])
      [1, 1, 3, 4, 5, 9]
      >>> sort_ascending([10, 40, 20, 30, 50])
      [10, 20, 30, 40, 50]
      """
output:     for i in range(len(nums)):
          min_idx = i
          for j in range(i+1, len(nums)):
              if nums[j] < nums[min_idx]:
                  min_idx = j
          nums[i], nums[min_idx] = nums[min_idx], nums[i]
      return nums