一维数组选择排序 递归和两次循环实现

package lengreen.sort;

import java.util.Random;

import lengreen.pub.U;

public class ChooseSort {
	public static void main(String[] args) {
		int[] arr = {12, 23, 9, 24, 15, 3, 18};
		U.prtArr1D(arr);
//		recursionSort(arr, 0);
		commonSort(arr);
		U.prtArr1D(arr);
	}
	
	/**
	 * 递归排序
	 * @param arr
	 */
	private static void recursionSort(int[] arr, int index) {
		if(index < arr.length) {
			for (int i = 0; i < arr.length; i++) {
				if(arr[index] < arr[i]) {
					int tmp = arr[index];
					arr[index] = arr[i];
					arr[i] = tmp;
				}
			}
			index ++;
			recursionSort(arr, index);
		}
	}
	
	/**
	 * 通常选择排序
	 * @param arr
	 */
	private static void commonSort(int[] arr) {
		int n = arr.length;
		for (int i = 0; i < n; i++) {
			for(int j = i + 1; j < n; j++) {
				if(arr[i] > arr[j]) {
					int tmp = arr[j];
					arr[j] = arr[i];
					arr[i] = tmp;
				}
			}
		}
	}
}