There are a lot of combo solutions for single arrays or vectors of arrays where you need every possible permutation, but I need slightly different solution. Ive tried hacking pieces together but can no longer see the wood for the trees.
I need a solution that will take a csv file which contains anything up to 50 columns and any number of rows of words per column. The number of rows per column can be different.
what i need to do is take this input and in tu iterate through each column choosing one word to create every possible row combination, skipping any row/column that is null. nested loops would do this for a preset number of columns but as columns change this is a problem. fairly new to programming. hoping its a fairly simple logical concept im missing.
For example:
input:
bear, claw, donut
chicken, salad,
tuna,,salad
output:
bear, claw, donut
bear, salad, donut
bear, salad
chicken, claw, donut
chicken, salad, donut
chicken, claw
chicken, salad
chicken, salad, donut
...
tuna, claw, salad
tuna, salad etc