java冒泡排序
package org.lanqiao;
import java.util.Arrays;
import java.util.Scanner;
public class MaoPaoSort {
public static void maopaoSort( int[]x ) {
for (int i = 0; i < x.length-1; i++) {
for (int j = 0; j < x.length-1-i; j++) {
if (x[j]>x[j+1]) {
int temp=x[j];
x[j]=x[j+1];
x[j+1]=temp;
}
}
}
}
public static void main(String[] args) {
Scanner input =new Scanner(System.in);
int [] i=new int[5] ;
for(int j = 0;j<i.length;j++) {
System.out.println("请输入第"+(j+1)+"个数组元素");
i[j]=input.nextInt();
}
maopaoSort(i);
System.out.println(Arrays.toString(i));//Arrays.toString(i) 将数组i打印出来
}
}
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/77bbf9f3470018c76d518f87451d7e5c.png)