Java演算法 選擇排序演算法例子

代碼：

 

package com.xu.main;public class P11_1 {static final int SIZE = 10;public static void selectSort(int a[]){int index,temp;for(int i=0;i<a.length;i++){index = i;for(int j=i+1;j<a.length;j++){if(a[j] < a[index]){index = j;}}//交換兩個數if(index!=i){temp = a[i];a[i] = a[index];a[index] = temp;}System.out.print("第"+ i + "步排序結果：");for(int h=0;h<a.length;h++){System.out.print(" "+a[h]);}System.out.println();}}public static void main(String[] args) {int[] shuzu = new int[SIZE];int i;for(i=0;i<SIZE;i++){shuzu[i] = (int) (100+Math.random()*(100+1));}System.out.println("排序前的數組為：");for(i=0;i<SIZE;i++){System.out.print(shuzu[i]+" ");}System.out.println();selectSort(shuzu);System.out.println("排序後的數組為：");for(i=0;i<SIZE;i++){System.out.print(shuzu[i]+" ");}System.out.println();}}

 

運行結果: