快速排序 Java

import java.util.Random;


public class MyTest {

	public static void main(String[] args) {
//		int [] array = {7, 5, 10, 2, 6, 3, 9, 1, 11, 4};
		
		int [] array = new int[10];
		
		System.out.println("Array is:");
		Random random = new Random(System.currentTimeMillis());
		for (int i = 0; i < array.length; i++) {
			array[i] = random.nextInt(30);
			System.out.println("" + array[i]);
		}

		quickSort(array, 0, 9);
		
		
		System.out.println("After sort");
		for (int i = 0; i < 10; i++) {
			System.out.println("" + array[i]);
		}
	}
	
	public static void quickSort(int[] array, int first, int last) {
		int i = first;
		int j = last;
		
		if (i < j) {
			int x = array[first];
			
			while (i < j) {
				
				for (; j > i; j--) {
					if (array[j] < x) {
						array[i] = array[j];
						i = i + 1;
						break;
					}
				}
				
				for (; i < j; i++) {
					if (array[i] > x) {
						array[j] = array[i];
						j = j - 1;
						break;
					}
				}
			}
			
			array[i] = x;
			
			quickSort(array, first, i - 1);
			quickSort(array, i + 1, last);
		}
	}
}