冒泡排序（java）

import java.util.Random;

 

public class BubbleSort {

    public static void main (String [] args)

    {

       Random rd = new Random();

      

       int [] nums = {rd.nextInt(100),rd.nextInt(100),

              rd.nextInt(100),rd.nextInt(100),

              rd.nextInt(100),rd.nextInt(100),

              rd.nextInt(100),rd.nextInt(100),

              rd.nextInt(100),rd.nextInt(100)};

      

       System.out.println("排序之前。。。。");

       for(int n:nums){

          

           System.out.print(n+"、");

       }

      

       //arraySort(nums);

       arraySort2(nums);

       System.out.println();

       System.out.println("排序之后。。。。");

       for(int n:nums){

          

           System.out.print(n+"、");

       }

      

    }

   

    public static void arraySort(int [] nums){

      

       for(int i=0;i<nums.length;i++){

           System.out.println(i);

           for(int j = 0;j<nums.length-i-1;j++){

              if(nums[j]>nums[j+1]){

                  int temp = nums[j];

                  nums[j] = nums[j+1];

                  nums[j+1]= temp;

              }

           }

       }

    }

   

    public static void arraySort2(int[]nums){

      

       for(int i=0;i<nums.length;i++){

           for(int j=0;j<nums.length-1-i;j++){

              if(nums[j]<nums[j+1]){

                  int temp = nums[j+1];

                  nums[j+1] = nums[j];

                  nums[j]=temp;

              }

           }

       }

      

    }

}