class Solution:
  def sort(self, nums):
    
    def swap(i, j):
      temp = nums[i]
      nums[i] = nums[j]
      nums[j] = temp
    
    for i in range(len(nums)):
      # while the nums[i] is not in position keep swapping it
      while nums[i] != i + 1:
        swap(i, nums[i] - 1)

    return nums