public class BubbleSort {
public static void main(String[] args) {
int[] ary = {23,5,1,8,0,76,45,89,234};
//i表示轮数
// for (int i=0;i<ary.length-1;i++){
// //j表示遍历到的元素下标,轮数不同,最大下标不同
// for (int j=0;j<ary.length-1-i;j++){
// if (ary[j]>ary[j+1]){
// int tmp = ary[j];
// ary[j] = ary[j+1];
// ary[j+1] = tmp;
// }
// }
// }
// System.out.println(Arrays.toString(ary));
//使用冒泡排序降序排列
// for (int i=0;i<ary.length-1;i++){
// for (int j=0;j<ary.length-1-i;j++){
// if (ary[j]<ary[j+1]){
// int tmp = ary[j];
// ary[j] = ary[j+1];
// ary[j+1] = tmp;
// }
// }
// }
// System.out.println(Arrays.toString(ary));
//引用类型数组若要排序,必须保证数组中元素所属的类实现了Comparable
String[] ary1 = {"tom","jack","rose","张三","李四","tony"};
for (int i=0;i<ary1.length-1;i++){
for (int j=0;j<ary1.length-1-i;j++){
if (ary1[j].compareTo(ary1[j+1])>0){
String tmp = ary1[j];
ary1[j] = ary1[j+1];
ary1[j+1] = tmp;
}
}
}
System.out.println(Arrays.toString(ary1));
}
}
java冒泡排序
最新推荐文章于 2023-06-06 09:14:05 发布