**Fibonacci search** is an efficient search algorithm based on **divide and conquer** principle that can find an element in the given sorted array with the help of Fibonacci series in O(log N) time complexity. This is based on Fibonacci series which is an infinite sequence of numbers denoting a pattern which is captured by the following equation: F(n+1) = F(n) + F(n-1)

**Read this article to understand Fibonacci Search in depth**

**Have a doubt or thought? Join the discussion now**

This is a companion discussion topic for the original entry at http://iq.opengenus.org/fibonacci-search/