No, its not. See carefully... After push or pop, we have to modify the heap using min heapify function which takes O(log n) time
On Tue, Jun 28, 2011 at 11:21 PM, juver++ <[email protected]> wrote: > pop() and push() are O(1) both in this algo. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/dbfa0H-3n38J. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
