Pick up the array implementation

I have written an implementation of a Priority Queue using unsorted arrays (actually, Standish wrote it and I modified it a bit). It is available from my web page at:

http://rocky.colby.edu/cs231/code/hw5

1.

Download, compile and run this program.

NOTE: In order to keep everything in one file, I have included some code in PriorityQueue for testing. In general, though, the code that uses an ADT (the client) will be in a different module than the implementation. For now, just try to keep them separate in your mind.