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;
  }
};