Sciweavers

2 search results - page 1 / 1
» A Meticulous Analysis of Mergesort Programs
Sort
View
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
13 years 9 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
ICALP
1993
Springer
13 years 9 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin