Time distribution analysis for binary search of a linked list

Authors:
Firooz Khosraviyani;Mohammad H. Moadab;Douglas F. Hale
Affiliations:
UT Permian Basin, Odessa, TX;Virginia State University, Petersburg, VA;UT Permian Basin, Odessa, TX
Venue:
ACM SIGCSE Bulletin
Year:
1991

Citing 4
Cited 0

Applied regression analysis and other multivariable methods

Applied regression analysis and other multivariable methods
Using binary search on a linked list

ACM SIGCSE Bulletin
Data Structure Techniques

Data Structure Techniques
Using Multivariate Statistics (5th Edition)

Using Multivariate Statistics (5th Edition)

Quantified Score

Hi-index	0.00

Visualization

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.