Need help on Priority Queue Implementations

Hi Everyone,

I need implementations of Priority Queue by using ordered array,unordered array,ordered linked list and unordered linked list and also for the heap.I tried on internet for examples but they are very simple not interactive.I need operations like Insert,findMax,delMax and merge in interactive mode and also I need time measurements.Please help me for these implementations in C++.

Thanks in advance.
Topic archived. No new replies allowed.