public class insertTest {
public static void main(String[] args) {
int[] ins = {5,4,3,1,6,7,9,2,35};
int[] ins2 = sort(ins);
for(int in:ins2){
System.out.println(in);
}
}
private static int[] sort(int[] ins) {
for (int i = 1;i< ins.length;i++){
for (int j = i;j>0;j--){
if (ins[j]<ins[j-1]){
int temp = ins[j-1];
ins[j-1] = ins[j];
ins[j] = temp;
}
}
}
return ins;
}
}
java简单选择排序实现
最新推荐文章于 2024-07-14 22:26:46 发布