算法之冒泡排序(BubbleSort)

 

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

 

转载于:https://www.cnblogs.com/boguse/p/7661869.html