选择排序算法（Selection Sort）

 // 定义方法实现选择排序
 public static void selectionSort(int[] array) {
 int count = 1;
 while (count >= 1) {
 int index = 0;
 int max = array[0];
 for (int i = 1; i <= array.length - count; i++) {
 if (max < array[i]) {
					max = array[i];
					index = i;
 }
 }
 int temp = array[array.length - count];
			array[array.length - count] = max;
			array[index] = temp;
			count++;
 if (count == array.length - 1) {
 break;
 }
 }
 }
}
案例：

public class SelectSort {
 public static void main(String[] args) {
 int[] array = {63, 4, 24, 1, 3, 15};
 System.out.println("排序前：");
 for (int i : array) {
 System.out.print(i + "\t");
 }
 System.out.println();
		selectionSort(array);
 System.out.println("排序后：");
 for (int i : array) {
 System.out.print(i + "\t");
 }
 }
 
 // 定义方法实现选择排序
 public static void selectionSort(int[] array) {
 int count = 1;
 while (count >= 1) {
 int index = 0;
 int max = array[0];
 for (int i = 1; i <= array.length - count; i++) {
 if (max < array[i]) {
					max = array[i];
					index = i;
 }
 }
 int temp = array[array.length - count];
			array[array.length - count] = max;
			array[index] = temp;
			count++;
 if (count == array.length - 1) {
 break;
 }
 }
 }
}