why is it that the average time complexity of fibonacci search which you mentioned is same as that of binary searchs time complexity inspite of more comparisons being executed by fibonacci search in comparision to binary search .......
Hello Arjun,
Time Complexity is more about how things scale with increasing input size and not about the cost of each iteration.
A complexity of O(logn) would simply mean that if the length of the input array is doubled, the effort involved is about 30% more than that of the original input.
This stack overflow answer explains it beautifully.