快速排序（SelectionSort）

package array;

/***
 * 
 * @time 2012/2/19
 */
public class SelectSort {
	public static void main(String[] args) {

		int a[] = { 1, 5, 6, 2, 3, 8, 10, 7, 9 };//静态定义一个数组
		System.out.println("将下列数排序：");
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i] + " ");
		}
		selectionSort(a);
		for (int i = 0; i < args.length; i++) {
			System.out.print(args[i] + " ");
		}
	}

	/**
	 * 选择排序
	 */
	public static void selectionSort(int a[]) {
		int k, temp;// K做标记，temp临时变量
		for (int i = 0; i < a.length; i++) {
			k = i;
			for (int j = i + 1; j < a.length; j++) {
				if (a[k] > a[j]) {// 选出当前数小的数
					k = j;

				}
				
			}
			// 进行数据交换
			if (k != i) {
				temp = a[i];

				a[i] = a[k];

				a[k] = temp;
			}
			
		}
		System.out.println("\n排序之后的序列为：");
		for (int i = 0; i < a.length; i++) {
			System.out.print(a[i] + " ");
		}

	}