I have to build two implementations of a priority queue: Ordered array and a Binary heap.

/* PQTestObject.java A simple testing object that has a priority. The sequence number in this class is NOT the insertion sequence number you will have in the BinaryHeapPQ class. It is only used for verification of correct behavior, and never used in ordering objects of this class. */ public class PQTestObject implements Comparable<PQTestObject> { private int priority; private long sequence_number; public PQTestObject(int p, long s) { priority = p; sequence_number = s; } public int compareTo(PQTestObject o) { return priority - o.priority; } public String toString() { return priority + " " + sequence_number; } }