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:
“So long as the source of our identity is externalvested in how others judge our performance at work, or how others judge our childrens performance, or how much money we makewe will find ourselves hopelessly flawed, forever short of the ideal.”
—Melinda M. Marshall (20th century)
“No performance is worth loss of geniality. Tis a cruel price we pay for certain fancy goods called fine arts and philosophy.”
—Ralph Waldo Emerson (18031882)
“What avails it that you are a Christian, if you are not purer than the heathen, if you deny yourself no more, if you are not more religious? I know of many systems of religion esteemed heathenish whose precepts fill the reader with shame, and provoke him to new endeavors, though it be to the performance of rites merely.”
—Henry David Thoreau (18171862)