Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2012:journals:virginia:chapter2 [2012/01/25 01:53] – [Section 5: Priority Queues] lovellv | courses:cs211:winter2012:journals:virginia:chapter2 [2012/01/25 01:53] (current) – [Section 5: Priority Queues] lovellv | ||
|---|---|---|---|
| Line 77: | Line 77: | ||
| Thus, if we implement a priority queue with a heap, we get O(n) time to start the queue, O(logn) time to insert, O(1) time to find the minimum key, O(logn) time to delete and O(logn) to extract the value with minimum key. | Thus, if we implement a priority queue with a heap, we get O(n) time to start the queue, O(logn) time to insert, O(1) time to find the minimum key, O(logn) time to delete and O(logn) to extract the value with minimum key. | ||
| + | Readability: | ||
