sorttest.java

来自「很实用的一个排序算法的JAVA 实现」· Java 代码 · 共 43 行

public class SortTest{
	public static void main(String [] args){
		int [] num={3,4,6,8,1,9,2,5,10};
		int len=num.length-1;
		SortTest st=new SortTest();
		st.print(num);
		st.sort(num,0,len);
        System.out.println("");
		st.print(num);

	}
	public void print(int [] num){
	   int lengt=num.length;
	   for(int i=0;i<lengt;i++){
	     System.out.print(num[i]+" ");
	   }
	}
	
    public void sort(int [] num,int left,int right){
		int temp=0;
		int i=left,j=right;
		if(left<right){
			while(left<right){
				while(num[++left]<num[i]);
				while(num[right]>num[i]){
					right--;
				}
				if(left<right){
				temp=num[left];
				  num[left]=num[right];
				   num[right]=temp;
				}
				   			
			}
			temp=num[i];
			num[i]=num[right];
			num[right]=temp;
			sort(num,i,right-1);
			sort(num,right+1,j);
			
		}
	} 
}