冒泡排序,双重循环外层控制趟数n-1,内层从0-n-1相邻元素作比较
//从大到小
import java.util.Scanner;
public class maopao {
public static void main(String[] args) {
int i, j, n;
int t;
@SuppressWarnings("resource")
Scanner input = new Scanner(System.in);
System.out.println("输入数组大小:");
n = input.nextInt();
int r[] = new int [n];
System.out.println("输入数组元素:");
for(i=0; i<n; i++)
r[i] = input.nextInt();
//双重循环,外层控制趟数
for(i=1;i<n;i++) {
int flag = 0;//如果没有发生交换说明排好序
for(j=0; j<n-1; j++) {
if(r[j]<r[j+1]) {
t = r[j];
r[j] = r[j+1];
r[j+1] = t;
}
}
if(flag==1)
break;
}
for(i=0; i<n; i++)
System.out.println(r[i]);
}
}