On the Optimality of Tape Merge of Two Lists with Similar Size
Sign Up to like & getrecommendations! Published in 2020 at "Algorithmica"
DOI: 10.1007/s00453-020-00690-x
Abstract: The 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… read more here.
Keywords: tape merge; optimality; size; two lists ... See more keywords