The time complexity of the Fibonacci Search Algorithm is O(logn) . The best-case time complexity is O(1) . It occurs when the element to be searched is the first element we compare.14-Feb-2021,
Description. Fibonacci search is a searching technique that depends on the Fibonacci numbers and it is based on the divide and conquer principle.
Time complexity is simply a measure of the time it takes for a function or expression to complete its task, as well as the name of the process to measure that time. It can be applied to almost any algorithm or function but is more useful for recursive functions.13-Jun-2018
Time Complexity:nnHence the time taken by recursive Fibonacci is O(2^n) or exponential.