Research and Advances

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 = [log2N+1], (1) where N is the number of records in the list and the square bracket means “integral part of.”

Advertisement

Author Archives

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved