快速排序

自己复习下基础，做下记录。。。

public class QSort {

	public static void qsort(int[] values, int start, int end) {
		if (start < 0 || start >= end || values == null || values.length <= 1) return;

		int sign = values[start];

		int i = start;
		int j = end;
		while (i < j) {
			while (j > i && values[j] >= sign) j --;
			values[i] = values[j];
			while (j > i && values[i] < sign) i ++;
			values[j] = values[i];
		}

		values[i] = sign;
		qsort(values, start, i);
		qsort(values, i + 1, end);

	}

	public static void main(String[] args) {
		int[] values =  { 73, 22, 93, 43, 55, 14, 28, 65, 39, 81, 33, 100 };

		qsort(values, 0, values.length - 1);
	}