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].
- [1] Dijkstra, E. W. Some beautiful arguments using mathematical induction. Acts Informatics, 13(1982), 1-15.Google Scholar
- [2] Golub, E. B., Augenstein, M. Creation of a new case for LUPSort: ALERNATING. 22nd SIGCSE Technical Symposium on Computer Science Education, SIGCSE Bulletin, 1991, vol. 23, number 1, 108-111. Google Scholar
Digital Library
- [3] Knuth, D. E. The Art of Computer Programming, volume 3: Sorting and Searching. Addison Wesley, 1973. Google Scholar
Digital Library
- [4] Merritt, S. M., Nauck, C. Y. Inventing a new sorting algorithm: a case study. 21st SIGCSE Technical Symposium on Computer Science Education, SIGCSE Bulletin vol. 22, number 1, 1990, 181-185. Google Scholar
Digital Library
- [5] Nagler, H. An estimation of the relative efficiency of two internal sorting methods. Communications of the ACM, vol. 3, number 11 (1960), 618-620. Google Scholar
Digital Library
- [6] Sedgewick R. Algorithms in C. Addison Wesley, 1990. Google Scholar
Digital Library
Index Terms
Average case analysis when merging two ordered lists of different length
Recommendations
Length of strings for a merge sort
Detailed statistics are given on the length of maximal sorted strings which result from the first (internal sort) phase of a merge sort onto tapes. It is shown that the strings produced by an alternating method (i.e. one which produces ascending and ...
Ordered partitions avoiding a permutation pattern of length 3
An ordered partition of [n]={1,2,...,n} is a partition whose blocks are endowed with a linear order. Let OP"n","k be the set of ordered partitions of [n] with k blocks and OP"n","k(@s) be the set of ordered partitions in OP"n","k that avoid a pattern @...
On the Optimality of Tape Merge of Two Lists with Similar Size
AbstractThe problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp (Sorting Search 3:197–207, 1999) independently discovered that the tape merge algorithm is ...






Comments