冒泡排序
package com.hanyi;
/*
*2021.3.25
* Java作业
*/
public class maopaopaixu1 {
public static void main(String[] args) {
int arr[] = {16, 25, 9, 90, 23};
int temp = 0;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
System.out.println("冒泡排序结果:");
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]+"\t");
}
}
}
冒泡运算减少循环:
package com.hanyi;
/*
*2021.3.25
* Java作业
*/
public class maopaopaixu1 {
public static void main(String[] args) {
int arr[] = {16, 25, 9, 90, 23};
boolean falg = false;
int temp = 0;
for (int i = 0; i < arr.length - 1; i++) {
falg = false;
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
falg = true;
}
}
if(!falg){
break;
}
}
System.out.println("冒泡排序结果:");
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]+"\t");
}
}
}