package Demo1_冒泡排序;
public class Demo1 {
/*public static void main(String[] args) {
int[] arr = {2,55,54,66,87,12,32,5,8,98,45,56};
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-1; j++) {
if (arr[j]<arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
for(int i = 0;i< arr.length;i++){
System.out.println(arr[i]);
}
}*/
public static void main(String[] args) {
int[] arr = {1,54,8,4545,45,12,78,6,656};
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-1; j++) {
if (arr[j]<arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
}
|
|
收藏
淘帖
踩
