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
  
  """
  Sort a list of integers in ascending order using a given 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([42, 99, 2, 18, 22, -5, 42])
  [-5, 2, 18, 22, 42, 42, 99]
  >>> sort_ascending([])
  []
  >>> sort_ascending([1])
  [1]
  """
  
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