Javascript 中的堆算法又名所有排列

Question

Goal:

I want to execute a specific function for every permutation of an array . I don't need to save intermediate permutations.

Paraphrase:

I'm searching for a Javascript implementation of Heap's algorithm , that calls a function for each permutation

Answer 1

Taken from here: https://en.wikipedia.org/wiki/Heap%27s_algorithm

/**
 * @brief : Heap's algorithm for permutating an array
 * @param callbackFunction: this function gets called for each permutation
 * @return : void
 * @props : This code is based on the algorithm stated on https://en.wikipedia.org/wiki/Heap%27s_algorithm
 **/
function permute(inputArr, callbackFunction) {
  function swap(array, index1, index2){
    let tmp = array[index1];
    array[index1] = array[index2];
    array[index2] = tmp;
  }
  let array = inputArr;
  let n = array.length;
  //c is an encoding of the stack state. c[k] encodes the for-loop counter for when generate(k+1, array) is called
  let c = Array(n);

  for (let i = 0; i < n; i += 1){
      c[i] = 0;
  }

  callbackFunction(array);

  //i acts similarly to the stack pointer
  let i = 0;
  while (i < n) {
      if (c[i] < i) {
          if (i % 2 == 0) {
              swap(array, 0, i);
          } else {
              swap(array, c[i], i);
          }

          callbackFunction(array);

          //Swap has occurred ending the for-loop. Simulate the increment of the for-loop counter
          c[i] += 1;
          //Simulate recursive call reaching the base case by bringing the pointer to the base case analog in the array
          i = 0;
      } else {
          //Calling generate(i+1, array) has ended as the for-loop terminated. Reset the state and simulate popping the stack by incrementing the pointer.
          c[i] = 0;
          i += 1;
      }
  }
}

You could call it like

permute ([1,2,3], function (array){
   document.write (JSON.stringify (array) + " ; ");
}