heapsorting.java

来自「sorting,分类的几种常见的java实现」· Java 代码 · 共 30 行

package sorting_yanrui;

import java.util.TimerTask;

public class HeapSorting {
	int c=0;
	static TimerTask timer;
	public long heapsort(int key[],int n)
	{
	    int i,w;
	    
	    
	    //compCount=shiftCount=0;
	    for (i=n/2;i>=1;i--) {QuickSorting.sift(key,i,n);c++;}
	    for (i=n;i>=2;i--)
	    {
	        c++;
	        w=key[i];//shiftCount++;
	        key[i]=key[1];//shiftCount++;
	        key[1]=w;//shiftCount++;
	        QuickSorting.sift(key,i-1,1);
	    }
	   

	long t=timer.scheduledExecutionTime();
	 return t;

}
}