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 constructed play is a Bach fugue when compared to life.”
—Helen Hayes (1900–1993)
“The woods were as fresh and full of vegetable life as a lichen in wet weather, and contained many interesting plants; but unless they are of white pine, they are treated with as little respect here as a mildew, and in the other case they are only the more quickly cut down.”
—Henry David Thoreau (1817–1862)