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 selection sort algorithm.
  >>> sort_ascending([5, 3, 2, 1, 4])
  [1, 2, 3, 4, 5]
  >>> sort_ascending([10, -2, 3, 0, 5])
  [-2, 0, 3, 5, 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