GfG QA is closing soon... Please refer PRACTICE or GfG now on wards !!

Time complexity of fibonacci search is O(logn) with base 2 or 3/2 ?

I was going through the post of fibonacci search, time complexity mentioned for the search there was O(logn) where base of log will be 2 as nothing mentioned there about the base but i think base should be 3/2 as in worst case every time the array will be divide in 2/3 parts. 

asked Aug 29, 2016 by sky tiwari