Java算法之选择排序法

选择排序法
package sort;
/*
* 选择排序算法
* @author Administrator
*
*/
public class SelectSort {

 static int[] a  = {1,3,44,78,345,9,11,56};

 /**数组遍历*/
public static void iterate(int[] a){
    for (int i = 0; i < a.length; i++) {
        System.out.print("  "+a[i]);
    }
}

/**数据元素交换*/
public static void swap(int a[], int index1,int index2){
    int temp = a[index1];
    a[index1] = a[index2];
    a[index2] = temp;
}

/**选择排序法*/
public static void selectSort(int a[]){
    for (int i = 0; i < a.length-1; i++) {
        for (int j = i; j < a.length -1; j++) {
            if (a[j] > a[j+1]) {
                swap(a,j,j+1);
            }
        }
    }

}


public static void main(String[] args) {

    System.out.print("排序前：");
    iterate(a);     //遍历

    selectSort(a);   //排序

    System.out.println();
    System.out.print("排序后：");
    iterate(a);     //遍历

}

}