java优先级队列

public class PriorityQ {
    private int maxSize;
    private long[] queArray;
    private int nItems;

    public PriorityQ(int s){
        maxSize = s;
        queArray = new long[s];
        nItems = 0;
    }
    public void insert(long item){
        int j;
        if(nItems == 0){
            queArray[nItems++] = item;
        }
        else{
            for(j=nItems-1;j>=0;j--){
                if(item>queArray[j]){
                    queArray[j+1] = queArray[j];
                }else{
                    break;
                }
            }
            queArray[j+1]=item;
            nItems++;
        }
    }
    public long remove(){
        return queArray[--nItems];
    }
    public long peekMin(){
        return queArray[nItems-1];
    }
    public boolean isEmpty(){
        return nItems==0;
    }
    public boolean isFull(){
        return nItems==maxSize;
    }

}

public class PriorityApp {
    public static void main(String[] args) {
        PriorityQ pq = new PriorityQ(5);
        pq.insert(20);
        pq.insert(10);
        pq.insert(30);
        pq.insert(50);
        pq.insert(40);

        while(!pq.isEmpty()){
            long item = pq.remove();
            System.out.print(item+" ");
        }
        System.out.println("");
    }
}

插入操作需要O(N)时间，删除操作O(1)时间