//本程序取自Clifford A.Shaffer著張銘等譯“數據結構與算法分析”第 159 頁，例8.2.3
//選擇排序問題解法
//Selection sort
import java.io.*;
class Examp8_2_3
 {
  static void selsort(int[] array)
     {
      int lowindex;
      for(int i=0;i<array.length-1;i++)
      { lowindex=i;//Remenber its  index
      for(int j=array.length-1;j>i;j--)
       if(key(array,j)<key(array,lowindex))     
       lowindex=j;       //Put it in place  
       swap(array,i,lowindex);
     } }
   public static void swap(int[] q,int i,int j)
     {
      int temp;
      temp=q[i];q[i]=q[j];q[j]=temp;
     }
  public static int key( int [] q,int p)
     {  return q[p];}
  public static void main(String args[]) 
     {
     int[] a={42,20,17,13,28,14,23,15};
     System.out.println("選擇排序之前");
     for(int i=0;i<=a.length-1;i++)
     System.out.print(a[i]+"  ");
     System.out.println();
   selsort(a);
     System.out.println("選擇排序之后");
     for(int i=0;i<=a.length-1;i++)
     System.out.print(a[i]+"  ");
     System.out.println();
    }
 }