Java简单冒泡排序示例解析

时间:2022-07-06 01:26:15

冒泡排序

从小到大排序:

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
package com.etime.test019;
 
import java.util.Arrays;
 
public class Test13 {
 
    public static void main(String[] args) {
 
        int[] array = { 6, 1, 2, 3, 8, 5, 4, 9, 7 };
        int len = array.length;
        System.out.println("排序前的数组为:"+Arrays.toString(array));
        int temp = 0;
        for (int i = 0; i < len - 1; i++) {
            for (int j = 0; j < len - 1 - i; j++) {
                if (array[j] > array[j + 1]) {
                    temp = array[j + 1];
                    array[j + 1] = array[j];
                    array[j] = temp;
                }
            }
        }
        System.out.println("排序后的数组为:"+Arrays.toString(array));
    }
}

从大到小排序:

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
package com.etime.test019;
 
import java.util.Arrays;
 
public class Test12 {
 
    public static void main(String[] args) {
 
        int[] array = { 2, 1, 6, 3, 9, 5, 8, 4, 7 };
        int len = array.length;
        System.out.println("排序前的数组为:"+Arrays.toString(array));
        int temp = 0;
        for (int i = 0; i < len - 1; i++) {
            for (int j = 0; j < len - 1 - i; j++) {
                if (array[j] < array[j + 1]) {
                    temp = array[j + 1];
                    array[j + 1] = array[j];
                    array[j] = temp;
                }
            }
        }
        System.out.print("排序后的数组为:"+Arrays.toString(array));
    }
}

从小到大排序效果图:

Java简单冒泡排序示例解析

从大到小排序效果图:

Java简单冒泡排序示例解析

 

到此这篇关于Java简单冒泡排序示例解析的文章就介绍到这了,更多相关Java简单冒泡排序内容请搜索服务器之家以前的文章或继续浏览下面的相关文章希望大家以后多多支持服务器之家!

原文链接:https://blog.csdn.net/Turniper/article/details/107750680