冒泡排序算法的学习（一）简单的实现冒泡排序-优快云博客

本文链接：https://blog.youkuaiyun.com/zoro_soro/article/details/137612974

本文介绍了三种不同的冒泡排序方法在Java中的实现：基本冒泡排序、优化版冒泡排序和改进的冒泡排序。通过示例展示了如何使用这些方法对整数数组进行排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package algorithm;

import java.util.Arrays;

/**
 * @ClassName BubbleSort
 * @Description TODO
 * @Author 22768
 * @Date 2024/4/10 21:31
 */
public class BubbleSort {
    public static void main(String[] args) {
        bubbleSort1();
        bubbleSort2();
        bubbleSort3();
    }


    private static void bubbleSort1(){
        int[] bubble = {2,1,6,9,4,3,7,5,8};
        int temp;
        for (int i = 0; i < bubble.length; i++) {
            for (int j = 0; j < bubble.length-1; j++) {
                if(bubble[j] < bubble[i]){
                    temp = bubble[j];
                    bubble[j] = bubble[i];
                    bubble[i] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(bubble));
    }

    private static void bubbleSort2(){
        int[] bubble = {2,1,6,9,4,3,7,5,8};
        int temp;
        for (int i = 0; i < bubble.length; i++) {
            for (int j = bubble.length-1; j >i; j--) {
                if(bubble[j] < bubble[i]){
                    temp = bubble[j];
                    bubble[j] = bubble[i];
                    bubble[i] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(bubble));
    }

    private static void bubbleSort3(){
        int[] bubble = {2,1,6,9,4,3,7,5,8};
        int temp;
        for (int i = 0; i < bubble.length; i++) {
            for (int j = 0; j < bubble.length - 1 - i; j++) {
                if(bubble[j] < bubble[j+1]){
                    temp = bubble[j];
                    bubble[j] = bubble[j+1];
                    bubble[j+1] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(bubble));
    }
}