排序怎么这么难啊！！？？请教高手

[easonu87]

public class selectionSort(int[] a){


int out , in , min;
for(out = 0;out<a.length;out++){
min = out;
for(in = out + 1;in < a.length; in++){
if(a[in]<a[min])
min = in;
swap(a,out,min);
}
}
//return a;

public void swap(int[] PArray , int one , int min){
int temp = PArray[one];
PArray[one] = PArray[min];
PArray[min] = temp;
}
}

public class Select{
public static void main(String []args)
{
selection s = new selection();
int [] a={4,7,1,3,9};
s.swap();

}
}

[梧桐林]

你得问题描述的不清楚哦~~~

[java_coding]

这位胸台，你这句话是什么？public class selectionSort(int[] a){