堆排序 JAVA

来源：互联网发布：windows手动更新补丁编辑：程序博客网时间：2024/06/16 08:19

class Heap{
   private java.util.ArrayListlist=new java.util.ArrayList();
   public Heap(){}
   public Heap(E[] objects){
       for(int i=0;i
        add(objects[i]);
   }
   public void add(E newObject){
      list.add(newObject);
   int currentIndex=list.size()-1;
   while(currentIndex>0){
       int parentIndex=(currentIndex-1)/2;
    if(list.get(currentIndex).compareTo(list.get(parentIndex))>0){
       E temp=list.get(currentIndex);
    list.set(currentIndex,list.get(parentIndex));
    list.set(parentIndex,temp);
    }
    else
      break;
   currentIndex=parentIndex;
   }
   }
   public E remove(){
      if(list.size()==0)return null;
   E removeObject=list.get(0);
   list.set(0,list.get(list.size()-1));
   list.remove(list.size()-1);

   int currentIndex=0;
   while(currentIndex
      int leftChildIndex=2*currentIndex+1;
   int rightChildIndex=2*currentIndex+2;

   if(leftChildIndex>=list.size())break;
   int maxIndex=leftChildIndex;
   if(rightChildIndex
     if(list.get(maxIndex).compareTo(list.get(rightChildIndex))<0){
       maxIndex=rightChildIndex;
     }
   }
   if(list.get(currentIndex).compareTo(list.get(maxIndex))<0){
    E temp=list.get(maxIndex);
    list.set(maxIndex,list.get(currentIndex));
    list.set(currentIndex,temp);
    currentIndex=maxIndex;
   }
   else
     break;
   }
   return removeObject;
   }
   public int getSize(){
    return list.size();
   }
}

public class HeapSort{
public static void hespSort(E[] list){
     Heapheap=new Heap();
for(int i=0;i
     heap.add(list[i]);
for(int i=list.length-1;i>=0;i--)
     list[i]=heap.remove();
}
public static void main(String[] args){
    Integer[] list={2,3,2,5,6,1,-2,3,14,12};
hespSort(list);
for(int i=0;i
   System.out.print(list[i]+" ");
   System.out.println();
}
}

0 0