The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1992 vol.41)
pp: 1172-1176
ABSTRACT
<p>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.</p>
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, September 1992, doi:10.1109/12.165398
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool