▁time ▁needed ▁to ▁access ▁a ▁storage ▁location . ▁If ▁the ▁machine ▁executing ▁the ▁search ▁has ▁a ▁direct ▁mapped ▁CPU ▁cache , ▁binary ▁search ▁may ▁lead ▁to ▁more ▁cache ▁miss es ▁because ▁the ▁elements ▁that ▁are ▁accessed ▁often ▁tend ▁to ▁gather ▁in ▁only ▁a ▁few ▁cache ▁lines ; ▁this ▁is ▁mit ig ated ▁by ▁splitting ▁the ▁array ▁in ▁parts ▁that ▁do ▁not ▁tend ▁to ▁be ▁powers ▁of ▁two . ▁If ▁the ▁data ▁is ▁stored ▁on ▁a ▁magnetic ▁t ape ▁where ▁seek ▁time ▁depends ▁on ▁the ▁current ▁head ▁position , ▁a ▁trade off ▁between ▁longer ▁seek ▁time ▁and ▁more ▁compar isons ▁may ▁lead ▁to ▁a ▁search ▁algorithm ▁that ▁is ▁ske wed ▁similarly ▁to ▁F ib on acci ▁search . ▁ ▁F ib on acci ▁search ▁is ▁derived ▁from ▁Golden ▁section ▁search , ▁an ▁algorithm ▁by ▁Jack ▁K ie fer ▁( 1 9 5 3 ) ▁to ▁search ▁for ▁the ▁maximum ▁or ▁minimum ▁of ▁a ▁un im od al ▁function ▁in ▁an ▁interval . ▁ ▁Algorithm ▁Let ▁k ▁be ▁defined ▁as ▁an ▁element ▁in ▁F , ▁the ▁array ▁of ▁F ib on acci ▁numbers . ▁n ▁= ▁F m ▁is ▁the ▁array ▁size . ▁If ▁n ▁is ▁not ▁a ▁F ib on acci ▁number , ▁let ▁F m ▁be ▁the ▁smallest ▁number ▁in ▁F ▁that ▁is ▁greater ▁than ▁n . ▁ ▁The ▁array ▁of ▁F ib on acci ▁numbers ▁is ▁defined ▁where ▁F k + 2 ▁= ▁F k + 1   +   F k , ▁when ▁k   ≥   0 , ▁F 1