Abstract
The article presents a formula for calculating the mathematical expectation of the number of comparisons needed to nd a record in a le in the case of generalized distribution of the probabilities of accessing records. We compare the eectiveness of the binary search method in the case of generalized distribution of probabilities of access to records and Zipf's law.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
