版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/weixin_40969422/article/details/80157373
package cn.bdqn_test;
import java.util.Arrays;
public class Test {
public static void main(String args[]) {
int[] arr={0,3,1,2,5,4,9,6,8,7};
System.out.println("排序前:");
for (int i : arr) {
System.out.print(i+"\t");
}
System.out.println("\n降序:");
Arrays.sort(arr);
for (int i : arr) {
System.out.print(i+"\t");
}
System.out.println("\n升序:");
int temp=0;
for (int i = 0; i < arr.length-1; i++) {
for (int j =0; j <arr.length-1-i; j++) {
if(arr[j]<arr[j+1]){
temp=arr[j+1];
arr[j+1]=arr[j];
arr[j]=temp;
}
}
}
for (int i : arr) {
System.out.print(i+"\t");
}
}
}