Q.

What is the time complexity of the above recursive implementation used to reverse a string?

A. o(1)
B. o(n)
C. o(n2)
D. o(n3)
Answer» B. o(n)
Explanation: the time complexity of the above recursive implementation used to
1.3k
0
Do you find this helpful?
11

Discussion

No comments yet