转载声明：文章来源https://blog.csdn.net/weixin_41457674/article/details/98517098

冒泡排序法

冒泡排序法原理示意图

public static void ArraySortTest() {

		int[] ages= {21,27,31,19,50,32,16,25};
		System.out.println(Arrays.toString(ages));
		//控制比较轮数
		for(int i=1;i			//每轮比较多少
			for(int j=0;j				if(ages[j]>ages[j+1]) {
					int tmp=0;
					tmp=ages[j];
					ages[j]=ages[j+1];
					ages[j+1]=tmp;					
				}
			}
		}
		System.out.println(Arrays.toString(ages));
	}