Priority queue push and pop operations
Hi,
The STL tutorial on this site says the push and pop operations of a priority queue is O(1) in complexity. Though they do mention that push_heap and pop_heap take O(log n) time. I was under the impression that priority queues are implemented using the heap property. I am obviously wrong. Could some throw more light on it or point to sources that do.
Thanks.
The STL tutorial on this site says the push and pop operations of a priority queue is O(1) in complexity. Though they do mention that push_heap and pop_heap take O(log n) time. I was under the impression that priority queues are implemented using the heap property. I am obviously wrong. Could some throw more light on it or point to sources that do.
Thanks.
Topic archived. No new replies allowed.