冒泡排序
package com.luo.demo;
import java.util.Arrays;
public class Maopao {
public static void main(String[] args) {
int[] arr = {1, 9, 6, 20, 3, 5};
int alen = arr.length;
int temp = 0;
for (int i = 1; i < alen; i++) {
System.out.print(arr[i]);
for (int j = 0; j < alen - i; j++) {
if (arr[j] > arr[j+1]) {
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.print(Arrays.toString(arr));
}
}
九九乘法表
package com.Rhovin.demo;
public class Rscanner {
public static void main(String[] args) {
for (int i = 1; i < 10; i++) {
for (int i1 = 1; i1 <= i; i1++) {
System.out.print("" + i1 + "*" + i + "=" + i*i1 +"\t");
}
System.out.print("\n");
}
}
}
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
1*5=5 2*5=10 3*5=15 4*5=20 5*5=25
1*6=6 2*6=12 3*6=18 4*6=24 5*6=30 6*6=36
1*7=7 2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49
1*8=8 2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64
1*9=9 2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81
Process finished with exit code 0
