How Can a Recursive Function Generate All Combinations from Multiple Arrays?

Recursive Function for Generating All Combinations of Items in Multiple Arrays

This question seeks a solution to generate all possible combinations of elements from multiple arrays of varying sizes.

The provided solution utilizes a recursive function combinations that takes an array of arrays ($arrays) as input. It recurses through the arrays recursively, combining elements from each array to form all possible combinations.

The recursion proceeds as follows:

• If the current array ($arrays[$i]) is the last in the input array (i.e., $i == count($arrays) - 1), it means we have reached the final level of recursion and simply return its elements.
• Otherwise, it calls the function recursively on the remaining arrays starting from the next index ($arrays[$i 1]).
• The function then iterates through each element of the current array ($arrays[$i]) and combines it with each of the combinations obtained from the recursive call.
• This process continues recursively until all arrays have been processed, resulting in all possible combinations.
• Finally, the function returns the generated combinations as an array.

An example usage of the function is provided to demonstrate its application to generate combinations from three arrays (arrayA, arrayB, and arrayC). The resulting combinations are printed in the desired format.

This recursive solution efficiently generates all possible combinations of elements from multiple arrays, irrespective of their number or size.

The above is the detailed content of How Can a Recursive Function Generate All Combinations from Multiple Arrays?. For more information, please follow other related articles on the PHP Chinese website!