This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Complexity of Search Algorithms
September 1992 (vol. 41 no. 9)
pp. 1172-1176

The average complexity for searching a record in a sorted file of records that are stored on a tape is analyzed for four search algorithms, namely, sequential search, binary search, Fibonacci search, and a modified version of Fibonacci search. The theoretical results are consistent with the recent simulation results by S. Nishihara and N. Nishino (1987). The results show that sequential search, Fibonacci search, and modified Fibonacci search are all better than binary search on a tape.

[1] D. E. Ferguson, "Fibonaccian searching,"Commun. ACM, vol. 3, no. 12, p. 648, Dec. 1960.
[2] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley, 1973.
[3] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[4] S. Nishihara and H. Nishino, "Binary search revisited: Another advantage of Fibonacci search,"IEEE Trans. Comput., vol. C-36, no. 9, pp. 1132-1135, Sept. 1987.

Index Terms:
record searching; tape storage; search algorithms; average complexity; sorted file; sequential search; binary search; Fibonacci search; modified Fibonacci search; computational complexity; search problems.
Citation:
Kuo-Liang Chung, Wen-Chin Chen, Ferng-Ching Lin, "On the Complexity of Search Algorithms," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1172-1176, Sept. 1992, doi:10.1109/12.165398
Usage of this product signifies your acceptance of the Terms of Use.