[algogeeks] Re: Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations.

Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations. How about a circular doubly linked list for the push and pop, and then a priority queue for the min? -- You received this message because you are subscribed to the Google Groups Algorithm

[algogeeks] Re: Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations.

@above What is the complexity of the pop_front() operation? O(1) -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to

[algogeeks] Re: Hard mathematical function

Hi Saravana, Why don't you try to find Prime numbers? Recently, some indian guy, showed that Prime is not NP anymore, but still, there's quite a lot effort to find a new prime numbers that are huge! And it's useful in encryption.