Java算法-冒泡排序

冒泡排序算法

---

废话不多说，先上算法代码。

算法代码

//冒泡排序
public class BubbleSort{
    public void sort(int[] a){
        int temp = 0;   //temp 临时存储数据，用于两个数据的替换
        //第一个for循环，控制比较到第几位。
        //例如第一次循环，会控制i到倒数第二位，这时会比较倒数第二位与倒数第一位的两个数的大小。
        for(int i = a.length - 1; i > 0; i--){
            //第二个for循环，用来依次比较两个相邻的数。
            for(int j = 0; j < i; j++){
                if(a[j + 1] < a[j]){
                    temp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = temp;
                }
                //加上输出代码，方便查看效果。每比较一次都输出下结果。
                for (int k = 0; k < a.length; k++){
                    System.out.print(a[k] + ",");
                }
                System.out.println();
            }
            //加上输出代码，方便查看效果。
            System.out.println("===================");
        }
    }
}

算法原理

1. 依次比较相邻的元素。如果第一个比第二个大，就交换他们两个。
2. 针对所有的元素重复以上的步骤，除了最后一个。
3. 持续每次对越来越少的元素重复上面的步骤，直到没有任何一对数字需要比较。

算法效果示例

传入数组：int[] a = {8,7,4,5,6,3,1,2,9,0}
以下为输出结果
7,8,4,5,6,3,1,2,9,0,
7,4,8,5,6,3,1,2,9,0,
7,4,5,8,6,3,1,2,9,0,
7,4,5,6,8,3,1,2,9,0,
7,4,5,6,3,8,1,2,9,0,
7,4,5,6,3,1,8,2,9,0,
7,4,5,6,3,1,2,8,9,0,
7,4,5,6,3,1,2,8,9,0,
7,4,5,6,3,1,2,8,0,9,

===================
4,7,5,6,3,1,2,8,0,9,
4,5,7,6,3,1,2,8,0,9,
4,5,6,7,3,1,2,8,0,9,
4,5,6,3,7,1,2,8,0,9,
4,5,6,3,1,7,2,8,0,9,
4,5,6,3,1,2,7,8,0,9,
4,5,6,3,1,2,7,8,0,9,
4,5,6,3,1,2,7,0,8,9,

===================
4,5,6,3,1,2,7,0,8,9,
4,5,6,3,1,2,7,0,8,9,
4,5,3,6,1,2,7,0,8,9,
4,5,3,1,6,2,7,0,8,9,
4,5,3,1,2,6,7,0,8,9,
4,5,3,1,2,6,7,0,8,9,
4,5,3,1,2,6,0,7,8,9,

===================
4,5,3,1,2,6,0,7,8,9,
4,3,5,1,2,6,0,7,8,9,
4,3,1,5,2,6,0,7,8,9,
4,3,1,2,5,6,0,7,8,9,
4,3,1,2,5,6,0,7,8,9,
4,3,1,2,5,0,6,7,8,9,

===================
3,4,1,2,5,0,6,7,8,9,
3,1,4,2,5,0,6,7,8,9,
3,1,2,4,5,0,6,7,8,9,
3,1,2,4,5,0,6,7,8,9,
3,1,2,4,0,5,6,7,8,9,

===================
1,3,2,4,0,5,6,7,8,9,
1,2,3,4,0,5,6,7,8,9,
1,2,3,4,0,5,6,7,8,9,
1,2,3,0,4,5,6,7,8,9,

===================
1,2,3,0,4,5,6,7,8,9,
1,2,3,0,4,5,6,7,8,9,
1,2,0,3,4,5,6,7,8,9,

===================
1,2,0,3,4,5,6,7,8,9,
1,0,2,3,4,5,6,7,8,9,

===================
0,1,2,3,4,5,6,7,8,9,

===================