package ArryDemo;
//冒泡排序案例
public class Arry6 {
public static void main(String[] args) {
//1.定义一个数组,存数据
int []arry6= {1,2,3,5};
//2.定义以一个1控制循环的轮数
for (int i = 0; i < arry6.length-1; i++) {
//i=1 笔记送次数3
for (int j = 0; j < arry6.length-1; j++) {
if (arry6[j]>arry6[j+1]){
int temp = arry6[j+1];
arry6[j+1]=arry6[1];
arry6[j] = temp;
}
}
}
//遍历数组输出
for (int i = 0; i < arry6.length; i++) {
System.out.println(arry6[i]+"\t");
}
}
}
输出结果为: