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 possible turn can not be programmed. It is caused by coincidence.”
—Friedrich Dürrenmatt (1921–1990)
“Oh, that I knew where I might find him, that I might come even to his dwelling! I would lay my case before him, and fill my mouth with arguments. I would learn what he would answer me, and understand what he would say to me. Would he contend with me in the greatness of his power? No; but he would give heed to me. There an upright person could reason with him, and I should be acquitted forever by my judge.”
—Bible: Hebrew, Job 23:3-7.
Job, of God.