版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/bingdianone/article/details/74416043
优化之前
package com.zy.control;
public class Desc {
public static void main(String[] args) {
// int num[]={1,9,2,8,7,3,4,6,5,0};
int num[] = { 2, 1, 0, 3, 4, 5, 8, 7, 6, 9 };
int min;
for (int i = 1; i < num.length; i++) {
// boolean change = true;
for (int j = 0; j < num.length - i; j++) {
if (num[j] > num[j + 1]) {
min = num[j];
num[j] = num[j + 1];
num[j + 1] = min;
// change = false;
}
}
for (int x = 0; x < num.length; x++)
System.out.print(num[x] + " ");
System.out.println("\n");
// if (change)
// break;
}
}
}
运行结果
1 0 2 3 4 5 7 6 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9
优化之后
package com.zy.control;
public class Desc {
public static void main(String[] args) {
// int num[]={1,9,2,8,7,3,4,6,5,0};
int num[] = { 2, 1, 0, 3, 4, 5, 8, 7, 6, 9 };
int min;
for (int i = 1; i < num.length; i++) {
boolean change = true;
for (int j = 0; j < num.length - i; j++) {
if (num[j] > num[j + 1]) {
min = num[j];
num[j] = num[j + 1];
num[j + 1] = min;
change = false;
}
}
for (int x = 0; x < num.length; x++)
System.out.print(num[x] + " ");
System.out.println("\n");
if (change)
break;
}
// for(int x=0;x<num.length;x++)
// System.out.print(num[x]+" ");
}
}
运行结果
1 0 2 3 4 5 7 6 8 9
0 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5 6 7 8 9