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:
“What is the worst of woes that wait on age?
What stamps the wrinkle deeper on the brow?
To view each loved one blotted from life’s page,
And be alone on earth, as I am now.”
—George Gordon Noel Byron (1788–1824)
“When trying a case [the famous judge] L. Cassius never failed to inquire “Who gained by it?” Man’s character is such that no one undertakes crimes without hope of gain.”
—Marcus Tullius Cicero (106–43 B.C.)