import java.util.Arrays;
public class Demo1 {
public static void main(String[] args) {
int[] arr={2,3,1,2,45,23,3,67,6,5,4,3,2,1,2,3,4,5};
//冒泡法排序
for (int i = 0; i <arr.length ; i++) {
for (int j = 0; j <arr.length-1-i ; j++) {
if (arr[j]>arr[j+1]){
int temp;
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
System.out.println(Arrays.toString(arr));
}
}
El resultado: