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
  
  """
  Implement a sorting algorithm in Python that takes a list of integers as input and outputs the list sorted in ascending order.
  >>> sort_ascending([4, 2, 1, 3])
  [1, 2, 3, 4]
  >>> sort_ascending([5, 3, 1, 4, 2])
  [1, 2, 3, 4, 5]
  """
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