Question: How to convert enumerate into recursion in Python? def combinations(array, tuple_length, prev_array=[]): if len(prev_array)== tuple_length: return [prev_array] combs = [] for i, val in enumerate(array):
How to convert enumerate into recursion in Python?
![How to convert enumerate into recursion in Python? def combinations(array, tuple_length, prev_array=[]):](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f4e5c260a7c_63366f4e5c1f067c.jpg)
def combinations(array, tuple_length, prev_array=[]): if len(prev_array)== tuple_length: return [prev_array] combs = [] for i, val in enumerate(array): prev_array_extended = prev_array.copy( ) prev_array_extended.append(val) combs += combinations(array [i+1:], tuple_length, prev_array_extended) return combs
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
