/* * PriorityQueue1.java * * Created on March 3, 2008, 5:15 PM * * To change this template, choose Tools | Template Manager * and open the template in the editor. */ package resizing; /** * * @author suchenek */ public class PriorityQueue1 { private int count; private int capacity; private int capacityIncrement; private int[] itemArray; /** Creates a new instance of PriorityQueue */ public PriorityQueue1() { count=0; capacity=10; capacityIncrement=5; itemArray=new int[capacity]; } public void insert(int newItem) { if(count==capacity) //no more space, "resize" the array up { capacity+=capacityIncrement; int[] tempArray = new int[capacity]; for (int i = 0; i < count; i++) { tempArray[i] = itemArray[i]; cnt.incr(); } itemArray = tempArray; } //enough space to insert int insertPosition = count; while ((insertPosition > 0) && (itemArray[insertPosition - 1] > newItem)) { insertPosition--; itemArray[insertPosition+1] = itemArray[insertPosition]; } itemArray[insertPosition] = newItem; count++; } public int remove() { if (count==0) return -9999; int itemReturned = itemArray[--count]; if ((count < capacity - capacityIncrement) && (10 <= capacity - capacityIncrement)) //space wasted, "resize" the array down { capacity-=capacityIncrement; int[] tempArray = new int[capacity]; for (int i = 0; i < count; i++) { tempArray[i] = itemArray[i]; // cnt.incr(); } itemArray = tempArray; } return itemReturned; } public int size() { return count; } public boolean isEmpty() { return count==0; } public int Length() { return itemArray.length; } }