I am working on a project that requires a priority queue with the following characteristics: Constant-Time Extraction: I need to efficiently extract the minimum element from the priority queue in constant time.
Additional Operations: The priority queue should support standard operations like insertion and decrease-key efficiently as well. I have considered using a binary heap, but the extraction time for the minimum element is logarithmic. My goal is to achieve constant time for this operation
I attempted to implement a standard binary heap for the priority queue. While the insertion and decrease-key operations are efficient, the logarithmic time complexity for extracting the minimum element doesn't meet my performance requirements.