//找出最大
int [] array={1,5,7,6};
for (int i = 0; i < array.length-1; i++) {
for (int j = 0; j < array.length-1-i; j++) {
if(array[j]>array[j+1]){
int temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
System.out.println("-------");
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]);
}

//冒泡排序
int array[]={1,3,2,7,5,9};
for (int i = 0; i < array.length-1; i++) {
for (int j = 0; j < array.length-1-i; j++) {
if(array[j]>array[j+1]){
int temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;

}
}
}
//排序後
for (int i = 0; i < array.length; i++) {
System.out.println(array[i]);
}

//打印正三角形
for (int i = 0; i < 5; i++) {
for (int j = 0; j <= i; j++) {
System.out.print("*");
}
System.out.println();
}
//等腰三角形
int row=4;//打印4行
for (int i = 0; i < row; i++) {
//循環打印空格
for (int j = 0; j < row-1-i; j++) {
System.out.print(" ");
}
for (int j = 0; j <2*i-1; j++) {
System.out.print("*");
}
System.out.println();
}

//九九乘法表
for (int i = 1; i <=9; i++) {
for (int j = 1; j <=i; j++) {
System.out.printf("%d*%d=%d\t",j,i,j*i);
}
System.out.println();
}

冒泡排序--打印三角形--九九乘法表