quicksorttest2.java

来自「使用ｊａｖａ数据结构编辑的解决八皇后问题的软件」· Java 代码 · 共 45 行

import java.util.*;

class QuickSortTest{
	public void sort(int data[],int length){
		quickSort(data,0,length-1);
	}
	private void quickSort(int data[],int left,int right){
		if(right >left){
			int i = left -1;
			int j = right;
			while(true){
				while(data[++i]<data[right])
					;
				while(j>0){
					if(data[--j]<=data[right])
						break;
				}
				if(i>=j) break;
				swap(data,i,j);
			}
			swap(data,i,right);
			quickSort(data,left,i-1);
			quickSort(data,i+1,right);
		}
	}
	private void swap(int data[],int a1,int a2){
		int t;
		t = data[a1];
		data[a1] = data[a2];
		data[a2] = t;
	}
	
	public static void main(String args[]){
		QuickSortTest q = new QuickSortTest();
		
		int a[] = {3,-2,90,800,25,70,200};
		
		q.sort(a,a.length);
		for(int i=0;i<a.length;i++){
			System.out.print(a[i]+" ");
		}
		System.out.println();
	}
}