冒泡排序

import java.util.*;

public class BubbleSort {
    public int[] bubbleSort(int[] A, int n)
    {
        for(int i=0;i < n-1;i++)
        {
            for(int j=0;j < n-1-i;j++)
            {
                if(A[j] > A[j+1])
                {
                    swap(A, j, j+1);
                }

            }
        }
        return A;
    }

    private void swap(int[] A, int index1, int index2)
    {
        int temp = A[index1];
        A[index1] = A[index2];
        A[index2] = temp;
    }


}