算法_选择排序算法

public void selectNumber(int[] number) {
int m;
for(int i=0;i<number.length-1;i++){
m = i;
for (int j = i+1; j < number.length; j++) {
if(number[j]<number[m]){
m=j;
}

}
if(m!=i)
SWAP(number,i,m);
}
}
private void SWAP(int[] number, int i, int m) {
// TODO Auto-generated method stub
int n;
n = number[i];
number[i] = number[m];
number[m] = n;

}