Solution: Cyclic Sort

Ofc it is just personally and we use std::swap.

class Solution {
public:
  vector<int> sort(vector<int> &nums) {
    auto i = 0;
    
    while(i < nums.size())
    {
      if(nums[i] == i + 1)
      {
          i++;
          continue;
      }
      auto jumpValue = nums[i];
      std::swap(nums[i], nums[jumpValue - 1]);
    }

    return nums;
  }
};

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

I had the same code as the solution except that in the Swap function I used the same int array name "nums" and it had weird behavior where the last entry is incorrect. When I changed it to a different name, like "arr" in the solution, it worked fine. I'm not sure if there is some hidden global variable names "nums" that is causing this weird behavior?

I thought I was going crazy because I couldn't find any difference in the logic of the code.

It still works with the below condition instead of if ( nums[i] != nums[j])

if (i !=j)