package suanfa;
//冒泡排序
public class Test1 {
public static void main(String[] args) {
int[] arr = new int[] { 9, 2, 3, 4, 0, 8, 6, 7 };
test(arr);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
}
}
public static void test(int[] arr) {
for (int i = arr.length - 1; i >= 0; i--) {
for (int j = i; j >= 0; j--) {
if (arr[j] >= arr[i]) {
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
for (int s = 0; s < arr.length; s++) {
System.out.print(arr[s]);
}
System.out.println("-------------------");
}
}
}
suanfa3==冒泡排序
最新推荐文章于 2024-08-04 11:07:52 发布