input: def sort_ascending(nums):
      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
  
  """ Sorts a list of integers in ascending order.
  >>> 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([5, -3, 8, -1, 0, 10])
  [-3, -1, 0, 5, 8, 10]
  """
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