排序——冒泡排序

package cn.tedu.csmall.product;

import java.util.Arrays;


public class demo {
    public static void main(String[] args) {
       int [] array=new int[100];
       for (int i=0;i< array.length;i++){
           array[i]= (int)(Math.random()*100);
       }
        System.out.println(Arrays.toString(array));
       suanfa(array);
        System.out.println(Arrays.toString(array));
    }
    public static void suanfa(int []array){

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

                }
            }
        }
    }
}

给定100长度的随机数数组，从大到小排序。