快速排序算法java实现_sinat_33201468的博客

package com.jintao.quicksort;

public class QuickSort
{

	public static void main(String[] args)
	{
		int array[] = new int []{5,6,3,8};
		quickSort(array, 0, array.length-1);
		
		for(int i:array)
		{
			System.out.print(i+" ");
		}

	}
	
	public static void quickSort(int array[],int low,int high)
	{
		if(low >= high)
		{
			return;
		}
		
		int i = low;
		int j = high;
		int key = array[i];
		while(i < j)
		{
			while(i<j && array[j] >= key)
			{
				j--;
			}
			
			array[i] = array[j];
			
			while(i <j && array[i] <= key)
			{
				i++;
			}
			
			array[j] = array[i];
			
		}
		
		array[i] = key;
		quickSort(array, low, i-1);
		quickSort(array, i+1, high);
	}
}
package com.jintao.quicksort;

public class Qui