Skip Navigation

The Computer Journal 1991 34(5):450-454; doi:10.1093/comjnl/34.5.450
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fenwick, P. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A New Technique for Self-Organising Linear Searches

P. M. Fenwick *

Department of Computer Science, University of Auckland, Auckland, New Zealand

Searches of sequential lists can be improved by moving active elements closer to the start of the list. Several existing techniques are investigated on a selection of text and program files, and compared with some new techniques. One of these new methods, which involves a simple transposition of the element just found with a randomly selected element about halfway towards the front of the list, is found to be an efficient method if the data are held in an array.

Received April 1988. revised June 1988.

* Department of Computer Science, University of Auckland, Auckland, New Zealand


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.