input: def sort_ascending(nums: List[int]) -> List[int]:
      """
      Sort a given list of integers in ascending order using a selection sort algorithm.
  
      >>> sort_ascending([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5])
      [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
      >>> sort_ascending([10, -5, 0, -3, 7])
      [-5, -3, 0, 7, 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