Function cyclicSort

javascript/0041-first-missing-positive.js:14–27

(nums, index = 0)

};

const cyclicSort = (nums, index = 0) => {
    while (index < nums.length) {
        const num = nums[index];
        const indexKey = num - 1;
        const indexNum = nums[indexKey];

        if (canSwap(nums, num, indexNum)) {
            swap(nums, index, indexKey);
            continue;
        }

        index += 1;
    }
};

const search = (nums, index = 0) => {
    while (index < nums.length) {