冒泡排序java代码

package sort;

import java.util.Arrays;

public class BubbleSort {
    public static  void bubbleSort(int[] a,int n){
        for (int i = 0; i i; j--) {
                if (a[j-1]>a[j]){
                    int tmp =a[j-1];
                    a[j-1]=a[j];
                    a[j]=tmp;
                    flag=true;
                }
            }
            if (flag==false){
                return;
            }
        }
    }

    public static void main(String[] args) {
        int[] a=new int[]{2,4,7,1,0};
        bubbleSort(a,5);
        System.out.println(Arrays.toString(a));
    }
}