java冒泡排序
2012-03-14 09:40
232 查看
public class sort {
/**
* 排序口诀
* 外层循环n-1;内层循环n-1-i(n代表数组长度,i代表外层循环的变量)
* @param args
*/
public static void main(String[] args) {
int aa[] = new int[] { 3, 8, 7, 4, 9 };
for (int i = 0; i < aa.length - 1; i++) {
for (int j = 0; j < aa.length - 1 - i; j++) {
int temp = 0;
if (aa[j] > aa[j + 1]) {//降序排序只需要把“>”变成“<”
temp = aa[j];
aa[j] = aa[j + 1];
aa[j + 1] = temp;
}
}
}
for (int i = 0; i < aa.length; i++) {
System.out.println(aa[i]);
}
}
}
/**
* 排序口诀
* 外层循环n-1;内层循环n-1-i(n代表数组长度,i代表外层循环的变量)
* @param args
*/
public static void main(String[] args) {
int aa[] = new int[] { 3, 8, 7, 4, 9 };
for (int i = 0; i < aa.length - 1; i++) {
for (int j = 0; j < aa.length - 1 - i; j++) {
int temp = 0;
if (aa[j] > aa[j + 1]) {//降序排序只需要把“>”变成“<”
temp = aa[j];
aa[j] = aa[j + 1];
aa[j + 1] = temp;
}
}
}
for (int i = 0; i < aa.length; i++) {
System.out.println(aa[i]);
}
}
}