杨辉三角
public static void main(String[] args) {
//杨辉三角,输出十层
// 1
// 1 1
// 1 2 1
// 1 3 3 1
// 1 4 6 4 1
int [][] arr = new int[10][];
for(int i = 0;i < arr.length;i++){
arr[i] = new int[i+1];
for(int j = 0;j < arr[i].length;j++){
if(j == 0 || j == arr[i].length -1){
arr[i][j] = 1;
}
else{
arr[i][j] = arr[i-1][j] + arr[i-1][j-1];
}
}
}
for(int i = 0; i < arr.length; i++) {
for(int j = 0; j < arr[i].length; j++)
{
System.out.print(arr[i][j] + "\t");
}
System.out.println();
}
}
冒泡排序:
冒泡排序
public static void main(String[] args) {
int [] arr = {1,2,3,6,5,15,9};
System.out.println("冒泡前结果为:");
for(int k = 0;k< arr.length;k++){
System.out.print(arr[k] + " ");
}
int temp = 0;
for(int i = 0;i < arr.length - 1;i++){
for(int j = 0;j <arr.length - i -1;j++){
if(arr[j] > arr[j+1]){
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.println("\n冒泡排序后结果为:");
for(int k = 0;k< arr.length;k++){
System.out.print(arr[k] + " ");
}
}