input: def sort_ascending(nums):
      """
      Sort a list of integers in ascending order using a basic selection sort algorithm.
  
      >>> sort_ascending([64, 25, 12, 22, 11])
      [11, 12, 22, 25, 64]
      >>> sort_ascending([5, 3, 8, 4, 2])
      [2, 3, 4, 5, 8]
      >>> sort_ascending([9, 7, 5, 3, 1])
      [1, 3, 5, 7, 9]
      """
output:     for i in range(len(nums)):
          min_idx = i
          for j in range(i+1, len(nums)):
              if nums[j] < nums[min_idx]:
                  min_idx = j
          nums[i], nums[min_idx] = nums[min_idx], nums[i]
      return nums