Question: why is this the correct answer? Consider the function fun from question Recursion on lists. What is the worst-case time complexity of fun I, when

why is this the correct answer?
Consider the function fun from question "Recursion on lists". What is the worst-case time complexity of fun I, when n = length 1? Select one alternative: o(n) O(n) (n log n) O 2(n) O(n2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
