Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Average binary search length for dense ordered lists

Average binary search length for dense ordered lists A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense—i.e. when records are in contiguous locations. It is easy to show that the maximum number of looks for a search L is given by 1. L = log 2 N +1, (1) where N is the number of records in the list and the square bracket means “integral part of.” http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Average binary search length for dense ordered lists

Flores, Ivan; Madpis, George
Communications of the ACM , Volume 14 (9) – Sep 1, 1971
Download PDF
2 pages

Loading next page...
 
/lp/association-for-computing-machinery/average-binary-search-length-for-dense-ordered-lists-LWfQsxz2SW

References (1)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1971 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/362663.362752
Publisher site
See Article on Publisher Site

Abstract

A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense—i.e. when records are in contiguous locations. It is easy to show that the maximum number of looks for a search L is given by 1. L = log 2 N +1, (1) where N is the number of records in the list and the square bracket means “integral part of.”

Journal

Communications of the ACM – Association for Computing Machinery

Published: Sep 1, 1971

There are no references for this article.