Write a generalized function that prints all combinations. No recursion

Question

I want to print all possible combinations of each of the numbers in the array and store all of the combinations inside an array.

So far what I have only flattens the array.

I know I need a function that takes an array as an argument and then returns all possible combinations.

let array = [
  [0, 1, 8],
  [2, 3],
  [4, 5]
 ];

const allPossibleCombinations = function (array) {
  const combinations = [];
        return array.reduce((p,c) =>
          [...p, ...c] );
};

console.log(allPossibleCombinations(array))

But I need this result

[ '0 2 4',
  '0 2 5',
  '0 3 4',
  '0 3 5',
  '1 2 4',
  '1 2 5',
  '1 3 4',
  '1 3 5',
  '8 2 4',
  '8 2 5',
  '8 3 4',
  '8 3 5' ]

There are several nonrecursive answers on [this question](http://stackoverflow.com/q/15298912/215552)... — Heretic Monkey, May 09 '17 at 21:58

score 0 · Answer 1 · answered May 09 '17 at 21:59

Probably not the most efficient solution, but this produces the desired output:

const [one, two, three] = [
  [0, 1, 8],
  [2, 3],
  [4, 5]
];
const output = [];

for (let i of one) {
   for (let j of two) {
      for (let h of three) {
         output.push([i, j, h]);
      }
   }
}

console.log(output);

Write a generalized function that prints all combinations. No recursion

1 Answers1