Worst Case
Although the total running time of a sequence of operations starting with an empty structure is bounded by the bounds given above, some (very few) operations in the sequence can take very long to complete (in particular delete and delete minimum have linear running time in the worst case). For this reason Fibonacci heaps and other amortized data structures may not be appropriate for real-time systems. It is possible to create a data structure which has the same worst case performance as the Fibonacci heap has amortized performance. However the resulting structure is very complicated, so it is not useful in most practical cases.
Read more about this topic: Fibonacci Heap
Famous quotes containing the words worst and/or case:
“The worst and best are both inclined
To snap like vixens at the truth.
But, O, beware the middle mind
That purrs and never shows a tooth!”
—Elinor Wylie (1885–1928)
“The circumstances with which every thing in this world is begirt, give every thing in this world its size and shape;—and by tightening it, or relaxing it, this way or that, make the thing to be, what it is—great—little—good—bad—indifferent or not indifferent, just as the case happens.”
—Laurence Sterne (1713–1768)