You are wrong. For priority queues based on heaps: O(1) for accessing minimum element. O(log n) for extracting (when current minimum is remved from the heap).
On 20 окт, 09:44, Saurabh Koar <saurabhkoar...@gmail.com> wrote: > Why u people r going for implementing Queue using Stacks?? > As Rahul Suggested in second thread can't this problem be solved by > Priority Queue that uses Min Heap functions???? It clearly takes O(1) > time for extracting minimum element.. > > -- > Thanks & Regards > Saurabh Koar > Final Year Under Graduate Student > Computer Science and Engineering > NIT Durgapur > India -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
