## The Fibonacci Heap

### By John Boyer

Table 2: Comparing the binary and Fibonacci heaps. means that the operation's time complexity is bounded both above and below--it won't take longer, but it won't take significantly less time, either. The O means that the time complexity is only bounded above: The operation won't take longer, but it may (under certain best-case conditions) take less than the stated time.

BACK TO ARTICLE

Copyright © 1997, Dr. Dobb's Journal