print all permutations of a given string.js

// https://stackoverflow.com/questions/7537791/understanding-recursion-to-generate-permutations/50382627#50382627
let str = "ABC";

permute(str, 0, str.length - 1, 0);

function permute(str, left, right, depth) {
  if (left === right) {
    console.log("PRINT:", str + "\n");
  } else {
    for (let i = left; i <= right; i++) {
      str = swap(str, left, i);
      permute(str, left + 1, right, depth + 1);
      str = swap(str, left, i);
    }
  }
}

function swap(str, left, right) {
  let charArr = str.split("");
  let leftTemp = charArr[left];
  charArr[left] = charArr[right];
  charArr[right] = leftTemp;
  return charArr.join("");
}