input: 
  def sort_ascending(nums: List[int]) -> List[int]:
      """ Sort a list of integers in ascending order using a selection sort algorithm.
      >>> sort_ascending([3, 2, 1, 4])
      [1, 2, 3, 4]
      >>> sort_ascending([10, 0, 4, 1, -1])
      [-1, 0, 1, 4, 10]
      """
      for i in range(len(nums)):
          min_idx = i
          for j in range(i + 1, len(nums)):
              if nums[min_idx] > nums[j]:
                  min_idx = j
          nums[i], nums[min_idx] = nums[min_idx], nums[i] 
      return nums
  
output:     for i in range(len(nums)):
          min_idx = i
          for j in range(i + 1, len(nums)):
              if nums[min_idx] > nums[j]:
                  min_idx = j
          nums[i], nums[min_idx] = nums[min_idx], nums[i] 
      return nums