Bubble Sortバブルソート

//Bubble Sort ( O(n²))

public class TestBubbleSort {

    

    public int[] bubbleSortArray(int[] arr){

        for(int i = 1 ; i < arr.length; i ++){

            for(int j = 0; j < arr.length -i ; j ++){

                if(arr[j]>arr[j+1]){

                    int temp;

                    temp = arr[j];

                    arr[j] = arr[j+1];

                    arr[j+1] = temp;

                }

            }

        }        

        return arr;    

    }

    

    

    public static void main(String[] args) {

        int[] arr = {6,2,4,1,5,9};

        TestBubbleSort test = new TestBubbleSort();

        arr = test.bubbleSortArray(arr);

        

        for(int i = 0 ; i < arr.length; i ++){

            System.out.println(arr[i]);

        }

    }



}

バブルソート(Bubble):隣接交換時間の複雑さ:(O(n)²))