java实现简单地冒泡排序

public class Maopao {
    
    
	public static void main(String[] args) {
    
    
		int[] a={
    
    25,38,29,16,22,17,19,14};
		int b=0;
		for(int i=0;i<a.length;i++){
    
    
			for(int j=0;j<a.length-1-i;j++){
    
    
			if(a[j]<a[j+1]){
    
    
				b=a[j+1];
				a[j+1]=a[j];
				a[j]=b;
			}	
			
		}
			System.out.println(a[i]);
			
	}

   }
}

猜你喜欢

转载自blog.csdn.net/weixin_43365615/article/details/112391464