Abstract

The aim of this article is to determine the probability distribution of sorting time for different sized linked lists utilizing binary search method and its comparison with results for sequential and binary tree search methods. In [1] the concept of binary search as applicable to linked lists has been discussed and compared with sequential search and (binary) tree search algorithms. Applying regression analysis, specific equations giving search times as a function of list size are determined. Regression analysis is also used to estimate the average performance of the binary search method in sorting linked lists.

Full Text
Published version (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