Average case analysis when merging two ordered lists of different length

Authors:
John A. Trono
Affiliations:
St . Michael's College, Colchester, Vt
Venue:
ACM SIGCSE Bulletin
Year:
1991

Citing 5
Cited 0

Algorithms in C

Algorithms in C
Creation of a new case for LUPSort: ALTERNATING

SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Inventing a new sorting algorithm: a case study

SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
An estimation of the relative efficiency of two internal sorting methods

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A derivation for the expected number of comparisons when merging two ordered lists is given, where the sizes of the individual lists are unknown but the size of the merged list is known. Other applications where this result can be applied are also mentioned, most notably the LUPSort algorithm of Merritt and Nauck[4].