Question: 12) What will be the time complexity of the following function? justify your answer. def find_subsets(arr, n): for i in range(0, 2**n): subset =
12) What will be the time complexity of the following function? justify your answer. def find_subsets(arr, n): for i in range(0, 2**n): subset = [] for j in range(0, n): if (i & (1 < 0: subset.append(arr[j]) print(subset) Put your solution here: Justification:
Step by Step Solution
There are 3 Steps involved in it
Answer It seems like youre trying to print hello in a nest... View full answer
Get step-by-step solutions from verified subject matter experts
