Performance
All of the following operations work in O(log n) time on a binomial heap with n elements:
- Insert a new element to the heap
- Find the element with minimum key
- Delete the element with minimum key from the heap
- Decrease key of a given element
- Delete given element from the heap
- Merge two given heaps to one heap
Finding the element with minimum key can also be done in O(1) by using an additional pointer to the minimum.
Read more about this topic: Binomial Heap
Famous quotes containing the word performance:
“Kind are her answers,
But her performance keeps no day;
Breaks time, as dancers,
From their own music when they stray.”
—Thomas Campion (1567–1620)
“They say all lovers swear more performance than they are able, and yet reserve an ability that they never perform; vowing more than the perfection of ten, and discharging less than the tenth part of one.”
—William Shakespeare (1564–1616)
“Nobody can misunderstand a boy like his own mother.... Mothers at present can bring children into the world, but this performance is apt to mark the end of their capacities. They can’t even attend to the elementary animal requirements of their offspring. It is quite surprising how many children survive in spite of their mothers.”
—Norman Douglas (1868–1952)