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:
“He took control of me for forty-five minutes. This time I’ll have control over him for the rest of his life. If he gets out fifteen years from now, I’ll know. I’ll check on him every three months through police computers. If he makes one mistake he’s going down again. I’ll make sure. I’m his worst enemy now.”
—Elizabeth Wilson, U.S. crime victim. As quoted in People magazine, p. 88 (May 31, 1993)
“A more problematic example is the parallel between the increasingly abstract and insubstantial picture of the physical universe which modern physics has given us and the popularity of abstract and non-representational forms of art and poetry. In each case the representation of reality is increasingly removed from the picture which is immediately presented to us by our senses.”
—Harvey Brooks (b. 1915)