有人問了,順手就寫了:
/*
* 冒泡算法
*/
int[] mao = new int[]{1,45,23,78,23,45,67,223,34};
for (int i = 0; i < mao.length; i++) {
for (int j = 0; j < mao.length-i-1; j++) {
if(mao[j]>mao[j+1]){
int flag = mao[j+1];
mao[j+1] = mao[j];
mao[j] = flag;
}
}
//System.out.println(Arrays.toString(mao));
}
/*
* 九乘九算法
*/
for (int i = 1; i <10; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(j+”*”+i+”=”+i*j+” “);
}
System.out.println();
}