Rosetta Code

Cartesian product of two or more lists

Build Cartesian products iteratively for a pair of lists and a three-list input.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/cartesian_product_of_two_or_more_lists.vibe
type RunResult = { three_lists: array<array<int | string>>, two_lists: array<array<int | string>> }

def cartesian_product(lists: array<array<int | string>>) -> array<array<int | string>>
  combinations: array<array<int | string>> = [[]]
  list_index = 0

  while list_index < lists.length
    current = lists.fetch(list_index)
    next_combinations: array<array<int | string>> = []
    combination_index = 0

    while combination_index < combinations.length
      prefix = combinations.fetch(combination_index)
      value_index = 0
      while value_index < current.length
        next_combinations.push(prefix + [current.fetch(value_index)])
        value_index = value_index + 1
      end
      combination_index = combination_index + 1
    end

    combinations = next_combinations
    list_index = list_index + 1
  end

  combinations
end

def run -> RunResult
  {
    two_lists: cartesian_product([["red", "blue"], [1, 2, 3]]),
    three_lists: cartesian_product([["small", "large"], ["circle", "square"], ["solid", "outline"]])
  }
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.