算法-冒泡排序（java）

 

package org.example.algorithm;



public class BubbleSort {
    public static void main(String[] args) {
        int[] arr = {9, 8, 7, 6, 5, 3, 2};
       int[] sortArr = new BubbleSort().bubbleSort(arr);
        for (int i : sortArr) {
            System.out.print(i);
        }
    }

    int[] bubbleSort(int[] arr) {
        int len = arr.length;
        int temp;
        for (int i = 0; i < len; i++) {
            for (int j = 0; j < len - i - 1; j++) {
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
        return arr;
    }
}