冒泡排序的升序和倒序

public class 循序安 {
public static void main(String[] args) {
int []arr={3,5,1,7,9,8,};
System.out.println(“旧的代码”);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");
}
System.out.println();
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]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
System.out.println(“新的代码升序”);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");
}

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]){
			int temp=arr[j];
			arr[j]=arr[j+1];
			arr[j+1]=temp;		
		}
	}
}
System.out.println();
System.out.println("倒序的代码");
for (int i = 0; i < arr.length; i++) {
	System.out.print(arr[i]+"\t");
}

}
}