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:
“I think the worst woman that ever existed would have made a man of very passable reputation—they are all better than us & their faults such as they are must originate with ourselves.”
—George Gordon Noel Byron (1788–1824)
“The real exertion in the case of an opera singer lies not so much in her singing as in her acting of a role, for nearly every modern opera makes great dramatic and physical demands.”
—Maria Jeritza (1887–1982)