冒泡排序--对数组中的元素进行降序排列

核心代码：

for (int i = 0；i < array.length;i++){
    for(int j = i;j < array.length;j++){
        if (array[i] < array[j]){
            int temp = array[i];
            array[i] = array[j];
            array[i] = temp;
        }
    }
}

text

import java.util.Random;
class lijia
{
     int x [] = new int[100];
     Random r = new Random();

     public  void getGrade()
     {
        for(int i = 0;i< x.length;i++)
        {
            x [i] = r.nextInt(100);
            System.out.print(x[i]+"  ") ;
        }
     }

     public double ave()
     {   
        double sum = 0 ;
        for(int i =0;ireturn sum/100;
     }

     public int max()
     {
        int max = x[0];
        for(int i = 0;iif(x[i]>max)
              max = x[i];
        }
        return max;
    }
    public void order()
    {
        int index;
        for(int i = 0;ifor(int j = i+1;jif(x[j]>x[i])
             {
                index = x[i] ; 
                x[i] = x[j] ; 
                x[j] = index;
             }
         }
         for(int i = 0;iout.print(x[i]+" ");
         }
    }   
}
class sy
{
    public static void main(String []args)
    {
     lijia g = new lijia();
     System.out.println("获取的一百个成绩：");
     g.getGrade();
     System.out.println();
     System.out.println("平均分为 ：");
     System.out.println(g.ave());
     System.out.println("最高分为：");
     System.out.println(g.max());
     System.out.println("排序后的结果：");
     g.order();
     System.out.println( );
    }
}