快速排序

快速排序算法实现

import java.util.Arrays;

public class Main {

	public static void main(String[] args) {
		int[] attr = { 8, 5, 4, 2, 3, 9 };
		sort(attr, 0, attr.length - 1);
		System.out.println(Arrays.toString(attr));
	}

	public static int getMid(int[] attr, int s, int e) {
		int key = attr[s];
		while (s < e) {
			while (s < e && key <= attr[e]) {
				e--;
			}
			attr[s] = attr[e];
			while (s < e && key >= attr[s]) {
				s++;
			}
			attr[e] = attr[s];
		}
		attr[s] = key;
		return s;
	}

	public static void sort(int[] attr, int s, int e) {
		if (s > e) {
			return;
		}
		int m = getMid(attr, s, e);
		sort(attr, s, m - 1);
		sort(attr, m + 1, e);
	}
}