sort.java

void sort(int[] number) 
{
  PriorityQueue<Integer, Integer> p = new HeapPriorityQueue();
  
  // insert array data into p
  for (int i=0; i< number.length; i++) {
     int x = number[i];
     p.insert(x, x);
  }
  // take out in sorted order putting into the array
  int i = 0;
  while (!p.isEmpty()) 
  {
    number[i] = p.deleteMin();
    i++;
  }
  
  // x is number sorted
}