Journal ArticleDOI
Building heaps fast
Colin McDiarmid,B. A. Reed +1 more
Reads0
Chats0
TLDR
An algorithm to construct a heap which uses on average (α + o(1))n comparisons to build a heap on n elements, where α ≈ 1.52, which is better than that known for any other algorithm.About:
This article is published in Journal of Algorithms.The article was published on 1989-09-01. It has received 67 citations till now. The article focuses on the topics: Heap (data structure) & d-ary heap.read more
Citations
More filters
Book
Data Structures and Algorithm Analysis in C
TL;DR: This book provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool and highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.
Journal ArticleDOI
On Convergence Rates in the Central Limit Theorems for Combinatorial Structures
TL;DR: A simple theorem is proved which applies to characterize the convergence rates in central limit theorems of Flajolet and Soria and is also applicable to arithmetical functions.
Book ChapterDOI
Efficient Implementation of Lazy Suffix Trees
TL;DR: The experiments show that for the problem of searching many exact patterns in a fixed input string, the lazy top-down construction is often faster and more space efficient than other methods.
Journal ArticleDOI
Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small)
TL;DR: A new variant of HEAP SORT, called BOTTOM-UP-HEAP Sort, is presented, and it is shown that this new sequential sorting algorithm is easy to implement and beats QUICK SORT on average and the best-off-three version of QUICKSORT.
Book
Algorithm Design and Applications
TL;DR: Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement.
References
More filters
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Journal ArticleDOI
A data structure for manipulating priority queues
TL;DR: A data structure is described which can be used for representing a collection of priority queues and the primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.