- ECE Home
- Undergraduate Studies
- Douglas Wilhelm Harder
- Algorithms and Data Structures Home
- Example Algorithms and Data Structures
- Sorting Algorithms
- Searching Algorithms
- Iterators
- Trees
- General Trees
- 2-3 Trees
- Skip Lists
- d-ary Heaps
- Bi-parental Heaps
- Array Resizing
- Sparse Matrices
- Disjoint Sets
- Maze Generation
- N Puzzles using A* Searches
- Project Scheduling
- The Fast Fourier Transform
- String distances
- Matrix-chain Multiplications
- Inverse Square Root
- Newton Polynomials
- Random Trees
- Normal Distributions
- Splay Trees
- Leftist Heaps
- Skew Heaps
- Binomial Heaps
d-ary Heaps
This has implementation of two d-ary heaps: ternary and quaternary heaps.
There is also a comparison of the run times of reasonably optimal implementations of binary, ternary, and quaternary heaps.
Algorithms and Data Structures
Department of Electrical and Computer Engineering
University of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
Phone: +1 519 888 4567 extension 37023
Facsimile: +1 519 746 3077
Department of Electrical and Computer Engineering
University of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
Phone: +1 519 888 4567 extension 37023
Facsimile: +1 519 746 3077
Website maintained by Douglas Wilhelm Harder