java day5

java day 5

****杨辉三角
public class yanghui {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[][] yanghui = new int[10][];// 定义二维数组
	for (int i = 0; i < yanghui.length; i++) {// 初始化二维数组,并将每行首元素和尾元素赋值为1
		yanghui[i] = new int[i + 1];
		yanghui[i][0] = 1;
		yanghui[i][i] = 1;
	}
	for (int i = 0; i < yanghui.length; i++) {// 遍历数组并输出初始化的杨辉三角
		for (int j = 0; j < yanghui[i].length; j++) {
			System.out.print(yanghui[i][j] + "\t");
		}
		System.out.println();
	}
	for (int i = 2; i < yanghui.length; i++) {// 给剩余的元素赋值,yanghui[i][j]=yanghui[i-1][j-1]+yanghui[i-1][j]
		for (int j = 1; j < yanghui[i].length - 1; j++) {
			yanghui[i][j] = yanghui[i - 1][j - 1] + yanghui[i - 1][j];
		}

	}
	for (int i = 0; i < yanghui.length; i++) {// 遍历数组并输出赋值后的杨辉三角
		for (int j = 0; j < yanghui[i].length; j++) {
			System.out.print(yanghui[i][j] + "\t");
		}
		System.out.println();

	}
}

}
冒泡排序
public class Bubblesort {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[] pp = new int[] { 30, 60, 52, 85, -14, -89, 79, 59, 63, 19, 48 };//初始化并给数组赋值
	// 冒泡排序
	for (int i = 0; i < pp.length-1; i++) {//外层控制循环次数,内层控制循环变量,遍历数组并排序
		for (int j = 0; j < pp.length-1-i; j++) {

			if (pp[j] > pp[j+1]) {
				int temp = 0;
				temp = pp[j+1];
				pp[j+1] = pp[j];
				pp[j] = temp;
			}

		}
	}
	for (int i = 0; i < pp.length; i++) {//输出排序后的数组元素
		System.out.print(pp[i] + "\t");
	}
}

}