容易的冒泡排序

简单的冒泡排序

import java.util.Random; //随机生成数的类public class maopao {        public void dis() {                int[] a = new int[10];                Random r = new Random(); //初始化随机生成数类                for (int i = 0; i < a.length; i++) {                        a[i] = r.nextInt(1000);                }                                for (int i = 0; i < a.length; i++) {                        for (int j = 0; j < a.length-i-1; j++) {                                if (a[j] > a[j+1]) {                                        int n = a[j+1];                                        a[j+1] = a[j];                                        a[j] = n;                                }                        }                }                                for (int i = 0; i < a.length; i++) {                        System.out.println(a[i]);                }        }                public static void main(String[] args) {                maopao p = new maopao();                p.dis();        }}