Fibonacci Search

Fibonacci Search

Fibonacci search is an efficient interval searching algorithm. It is similar to binary search in the sense that it is also based on the divide and conquer strategy and it also needs the array to be sorted. Moreover, the time complexity for both algorithms is logarithmic. It is called Fibonacci search because it utilizes the Fibonacci series (The current number is the sum of two predecessors F[i] = F[i-1] + F[i-2], F[0]=0 &F[1]=1 are the first two numbers in series.


Search Algorithm Searching Algorithm Sort Algorithm Divide and Conquer

Most Popular Articles

Recently Updated Articles