Searching Algorithms Questions
The time complexity of Fibonacci search is O(log n), where n is the number of elements in the sorted array being searched.