import java.util.Scanner;
public class SelectionSort {
public static void sort(int[] a, int n){
if(n<=1)
return;
for(int i=0; i<n-1; i++){
for(int j=i+1; j<n; j++){
if(a[i]>a[j])
swap(a, i, j);
}
}
}
private static void swap(int[] a, int i, int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
@SuppressWarnings("resource")
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N=0;
int[] a = new int[101];
System.out.println("请输入数组长度");
N = sc.nextInt();
for(int i=0; i<N; i++){
a[i] = sc.nextInt();
}
sort(a, N);
for(int i=0; i<N; i++){
System.out.print(a[i]+" ");
}
}
}
java 选择排序
原文：http://www.cnblogs.com/Oraice/p/5095085.html
