26 Mar
2010
26 Mar
'10
3:54 p.m.
- findMin - deleteMin - insert - changeKey - merge These can all be implemented quite efficiently (either worst case or amortized O(logn) time or better) for any heap model.
Just realized this isn't entirely true. A merge on two heaps can be O(n) depending on the model. In any case, still eagerly awaiting some sort of feedback. Dan Larkin