十八、二维数组内的排序

首先安排一维数组的冒泡排序

package arr2;

public class B {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
	int	a[]=new int[6];
	a[0]=1;
	a[1]=2;
	a[2]=3;
	a[3]=4;
	a[4]=5;
	a[5]=6;
	//int a1[]= {1,2,3,4,5};
	for (int i = 0; i < a.length; i++) {
		System.out.println(a[i]);
	}
	for (int i = 0; i < a.length; i++) {
		for (int j = 0; j < a.length-1-i; j++) {
			if (a[j]<a[j+1]) {
				int temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
			}
		}
	}
	for (int i = 0; i < a.length; i++) {
		System.out.println(a[i]);
	}
	}
	
}

结果

1
2
3
4
5
6
6
5
4
3
2
1

然后是二维数组的冒泡排序！！！

package arr2;

public class A {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int a[][]={{3,2,6},{6,8,2,10},{5},{12,3,23}};
//定义数组等式左边方括号里并未取值
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length-1; j++) {
				for (int j2 = 0; j2 < a[i].length; j2++) {
					if (a[i][j]<a[i][j+1]) {
						int temp=a[i][j];
						a[i][j]=a[i][j+1];
						a[i][j+1]=temp;
					}
					for (int k = 0; k < a[i].length-1-i; k++) {
						if (a[i][k]<a[i][k+1]) {
							int temp=a[i][k];
							a[i][k]=a[i][k+1];
							a[i][k+1]=temp;
						}
					}
				}
			}
		}
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.println(a[i][j]);
			}			
		}
		System.out.println("**********************");
		int x=0;
		int a1[]=new int[15];
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				a1[x]=a[i][j];
				++x;
			}
		}
		for (int i = 0; i < a1.length; i++) {
			System.out.println(a1[i]);
		}
		for (int i = 0; i < a1.length; i++) {
			for (int j = 0; j < a1.length-1-i; j++) {
				if (a1[j]<a1[j+1]) {
					int temp=a1[j];
					a1[j]=a1[j+1];
					a1[j+1]=temp;
				}
			}
		}
		System.out.println("*****************");
		for (int i = 0; i < a1.length; i++) {
			System.out.println(a1[i]);
		}
		System.out.println("最大值是："+a1[0]);
	}

}

结果

6
3
2
10
8
6
2
5
12
23
3
**********************
6
3
2
10
8
6
2
5
12
23
3
0
0
0
0
*****************
23
12
10
8
6
6
5
3
3
2
2
0
0
0
0
最大值是：23

伟大航路！！！

java王，我当定了！！！