JAVA学习笔记——数组

1.数组属于引用数据类型;

2：编写代码实现对随机数组的冒泡排序算法

import java.util.Random;
public class BubbleSort {
    public static void main(String[] args) {
        Random random = new Random();
        int[]a = new int[10];
        int i,j;
        System.out.println("原随机数组为：");
        for(i=0;i<a.length;i++){
            a[i] = random.nextInt(100);
            System.out.print(a[i]+" ");
        }

        for(i=0;i<a.length-1;i++){
            boolean exchange = false;
            for(j=0;j<a.length-1;j++){
                int temp;
                if(a[j]>a[j+1]) {
                    temp = a[j + 1];
                    a[j + 1] = a[j];
                    a[j] = temp;
                    exchange = true;
                }
            }
            if(exchange == false){
                break;
            }
        }
        System.out.println("排序之后的随机数组为：");
        for(i=0;i<a.length;i++){
            System.out.print(a[i]+" ");
        }
    }
}

3.编写代码实现对数组的乱序算法

import java.util.Random;
public class Bigorsmall {
    public static void main(String[] args) {
        int[] a={25,24,12,76,98,101,90,28};
        int i,tmp;
        int b;
        Random random = new Random();
        System.out.println("排序前：");
        for(i=0;i<8;i++)
        {

            System.out.print(a[i]+" ");
        }

//每次取随机位置的元素进行交换，共交换n-1次
        for (i=0;i<8;i++){
            b=random.nextInt(7);
            tmp=a[i];
            a[i]=a[b];
            a[b]=tmp;
       }
        System.out.println("\n"+"排序后：");
        for(i=0;i<8;i++){

            System.out.print(a[i]+" ");
        }
    }
}