一、冒泡排序
int[] arrs = {123,432,4,45,65,76,87,34,23,65,346};
for(int i = 0;i<arrs.length;i++){
for(int j=i+1;j<arrs.length;j++){
if(arrs[j]>arrs[i]){
int arrs_i = arrs[i];
int arrs_j = arrs[j];
arrs[i] = arrs_j ;
arrs[j] = arrs_i;
}
}
}
for(int i=0;i<arrs.length;i++){
system.out.printIn(arrs[i]);
}
二、递归实现斐波那契数列
public static int fun(int s){
if(s==0){
return 0;
}else if(s==1){
return 1;
}else{
return fun(s-1)+fun(s-2);
}
}
public static void main(String[] args) {
for(int i=0;i<=12;i++){
System.out.println(fun(i));
}
}