quicksort2.java

来自「我初学java时两个星期写的源代码」· Java 代码 · 共 41 行

package com.softeem.jbs;

public class QuickSort2 {

	public void sort(int[] data, int length) {
		quickSort(data, 0, data.length - 1);
	}

	public void quickSort(int[] data, int left, int right) {
		if (left < right) {
			int pivotkey = partition(data, left, right);
			quickSort(data, left, pivotkey - 1);
			quickSort(data, pivotkey + 1, right);
		}
	}

	public int partition(int[] data, int left, int right) {
		int pivotkey = data[left];
		while (left < right) {
			while (left < right && data[right] >= pivotkey)
				--right;
			data[left] = data[right];
			while (left < right && data[left] <= pivotkey)
				++left;
			data[right] = data[left];
		}
		data[left] = pivotkey;
		return left;
	}

	public static void main(String[] args) {
		QuickSort2 q = new QuickSort2();
		int[] a = { 100, 40, 60, 87, 34, 11, 56, 0 };
		q.sort(a, a.length);
		for (int i = 0; i < a.length; i++)
			System.out.println(a[i] + "");

	}

}