java稀疏数组的转换和冒泡排序算法

package userCommunite;

import java.util.Arrays;

public class Sort1 {
    public static void main(String[] args) {
        //
        int[][] array1 = new int[11][11];
        //定义一个11*11的二维数组
        array1[1][2] = 1;
        array1[2][3] = 2;
        System.out.println("输出原数组");
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt+" ");
            }
            System.out.println();
        }
        int sum = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if(array1[i][j]!=0){
                    sum++;
                }
            }
        }
        System.out.println("有效值个数"+sum);
        int[][] array2 = new int[sum+1][3];
        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum;
        //遍历二维数组，将非零的值，存放于稀疏数组中
        int count = 0;//计数原数组中的有效值个数
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if(array1[i][j]!=0){
                    count++;
                    array2[count][0] = i;
                    array2[count][1] = j;
                    array2[count][2] = array1[i][j];
                }
            }

        }
        System.out.println("输出稀疏数组");//第一行表示原数组的大小以及有效值
        for (int ints = 0; ints < array2.length; ints++) {
            System.out.println(array2[ints][0]+"\t"
                    + array2[ints][1]+"\t"+ array2[ints][2]+"\t");
        }
        //还原稀疏数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];
        System.out.println("还原后的稀疏数组");
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]] =array2[i][2];
        }
        for (int[] ints : array3) {
            for (int anInt : ints) {
                System.out.print(anInt+" ");
            }
            System.out.println();
        }
        System.out.println("=========================");
        int[] a = {1,6,2,7,9};
        System.out.println("冒泡法排序的原数组为"+Arrays.toString(a));
        int[] b = sort(a);  //调用冒泡法排序
        System.out.println("排序后的数组为："+Arrays.toString(b));

    }

    //定义冒泡法排序函数
    public  static int[]  sort(int[] array){
        int temp;
        for (int i = 0; i < array.length-1; i++) {
            for (int j = 0; j < array.length-1-i; j++) {
                if(array[j+1]<array[j]){
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                }
            }
        }
        return array;
    }


}

运行结果：