冒泡排序实现从小到大排序

 
 
    public static void bubbleSort(int[] arr){
        if(arr==null&&arr.length<2){
            return;
        }
        for (int end = arr.length-1;end>0;end--){
            for(int i = 0;i < end; i++){
                if(arr[i]>arr[i+1]){
                    swap(arr,i,i+1);
                }

            }
        }
    }


    //交换
    public static void swap(int[] arr,int i,int j){
        int temp=arr[i];
        arr[i]=arr[j];
        arr[j]=temp;
    }


    public static void main(String[] args) {
        int[] arr=new int[]{1,2,4,66,3,6,99,7};
        bubbleSort(arr);
        for (int i = 0;i<arr.length; i++){
            System.out.print(arr[i]+"  ");
        }
    }


猜你喜欢

转载自blog.csdn.net/li93675/article/details/80669085