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:
“Having an identity at work separate from an identity at home means that the work role can help absorb some of the emotional shock of domestic distress. Even a mediocre performance at the office can help a person repair self-esteem damaged in domestic battles.”
—Faye J. Crosby (20th century)
“Still be kind,
And eke out our performance with your mind.”
—William Shakespeare (1564–1616)
“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)