冒泡排序

package DataStruct.Sort;
//冒泡排序
public class BubblingSort {

    public static void main(String[] args)
    {
        int [] arr=new int[]{-1,3,1,2,0,7,-6,-4,22};
        bubbleSort(arr);
        for (int i=0;i<arr.length;i++)
        {
            System.out.println(arr[i]);
        }
    }
    public static  void bubbleSort(int [] arr)
    {
        for (int i=0;i<arr.length-1;i++)
        {
            for (int j=0;j<arr.length-1-i;j++)
            {
                if(arr[j]>arr[j+1])
                {
                    int temp=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=temp;
                }
            }
        }
    }

}