I have created a fibonacci search algorithm in a simple way using cpp.
We all know how to generate fibonacci numbers .
Using fibonacci numbers we can generate a searching technique.
Average and worst case time complexity of this algorithm is O(log n)
I have created a fibonacci search algorithm in a simple way using cpp. We all know how to generate fibonacci numbers . Using fibonacci numbers we can generate a searching technique. Average and worst case time complexity of this algorithm is O(log n)