Improving Mergesort for Linked Lists

Authors:
Salvador Roura
Affiliations:
-
Venue:
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Year:
1999

Citing 4
Cited 0

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal Sampling Strategies in Quicksort

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Improved Master Theorem for Divide-and-Conquer Recurrences

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a highly tuned mergesort algorithm that improves the cost bounds when used to sort linked lists of elements.We provide empirical comparisons of our algorithm with other mergesort algorithms. The paper also illustrates the sort of techniques that allow to speed a divide-and-conquer algorithm.