List of Tables
1.1 Average number of compares used by quicksort, 29
2.1 Classification of recurrences, 44
2.2 Elementary discrete sums, 48
2.3 Ruler and population count functions, 76
2.4 Binary divide-and-conquer recurrences and solutions, 78
3.5 Calculating moments from a BGF, 137
3.6 Classic “special” generating functions, 141
4.1 Asymptotic estimates for quicksort comparison counts, 161
4.2 Asymptotic expansions derived from Taylor series, 162
4.3 Accuracy of Stirling’s formula for N!, 164
4.4 Asymptotic estimates of the harmonic numbers, 165
Get An Introduction to the Analysis of Algorithms, Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.