一种快速排序算法

一种快速排序算法

//快速排序

public class TestQuickSort {
	static void quickSort(int data[], int begin, int end) {
		int lo = begin;
	    int hi = end;
	    int pivot;

	    if (begin<end) {
	    	pivot = data[(begin + end) / 2];
	    	while (lo <= hi) {
	    		while ((lo < end) && (data[lo]< pivot)) ++lo;
	    		while ((hi > begin) && (data[hi]>pivot)) --hi;
	    		
	    		// if the indexes have not crossed, swap
	    		if (lo <= hi) {
	    			int temp = data[hi];
	    			data[hi] = data[lo];
	    			data[lo] = temp;
	    			++lo;
	    			--hi;
	    			}
	    		}
	    	
	    	/*If the right index has not reached the left side of array must
		    now sort the left partition.*/
	    	if (begin < hi)
	    		quickSort(data, begin, hi);
	    	
	    	/*If the left index has not reached the right side of array must
		    now sort the right partition.*/
	    	if (lo < end)
	    		quickSort(data, lo, end);
	    	}
	    }
	
	public static void main(String[] args) {
		int[] nums = {6, 5, 4, 33, 0, 1, 22};
		System.out.println("快速排序前数组元素为：");
		for(int i=0;i<nums.length;i++){
			System.out.print(nums[i]+" ");
			}
		System.out.println();
		
		
		//应用快速排序方法
		System.out.println("快速排序后数组元素为：");
		quickSort(nums, 0, nums.length-1);
		
		//显示排序后的数组 
		for(int i = 0; i < nums.length; ++i) {
			System.out.print(nums[i] + " ");
			}
		System.out.println("");
		}
	}