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 readers are those who behave like plundering soldiers: they take away a few things they can use, soil and jumble what remains, and slander the whole.”
—Friedrich Nietzsche (1844–1900)
“It is almost everywhere the case that soon after it is begotten the greater part of human wisdom is laid to rest in repositories.”
—G.C. (Georg Christoph)