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([64, 25, 12, 22, 11])
      [11, 12, 22, 25, 64]
      >>> sort_ascending([3, 4, 5, 1, 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