What is the space complexity of the recursive implementation used to find the nth fibonacci term?
|Answer» A. o(1)|
|Explanation: the recursive implementation doesn’t store any values and calculates every value from scratch. so, the space complexity is o(1).|
Login to Continue
It will take less than 2 minutes