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 thing this nation could do for humanity would be to leave any uncertainty as to our will, our purpose and our capacity to carry out our purpose.”
—Hubert H. Humphrey (1911–1978)
“Consumer wants can have bizarre, frivolous, or even immoral origins, and an admirable case can still be made for a society that seeks to satisfy them. But the case cannot stand if it is the process of satisfying wants that creates the wants.”
—John Kenneth Galbraith (b. 1908)