public class MaoPao_XuanZe {
public static void main(String[] args){
int[] t=new int[]{3,4,6,2,9,5,1};
int[] f=maoPao(t);
//xuanZe(t);
}
public static int[] maoPao(int[] array){
for (int i = 0; i < array.length-1; i++) {
for (int j = 0; j < array.length-1-i; j++) {
if(array[j]>array[j+1]){
int f=array[j];
array[j]=array[j+1];
array[j+1]=f;
}
}
}
for (int i : array) {
System.out.println(i);
}
return array;
}
public static int[] xuanZe(int[] array){
for (int i = 0; i < array.length-1; i++) {
int index=i;//定义最小值下标
for (int j =i; j < array.length; j++) {//int j=i 每一轮循环找出一个最小
if(array[index]>array[j]){ //值不需要比第一轮a0 第二轮a1等
index=j;
}
}
if (index != i) {
int g = array[index];
array[index] = array[i];
array[i] = g;
}
}
for (int i : array) {
System.out.println(i);
}
return array;
}
}
冒泡排序与选择排序对比
最新推荐文章于 2022-01-14 13:47:13 发布