public class demo {
/*
* A B C
* 6 4 2
* 4 2 0
*
* */
用递归求最大公约数
public int gongYue(int a , int b){
int c=a%b;
if(c==0){
return b;
}
else {
return gongYue(b,c);
}
}
用递归求冒泡排序
public void maoPao(int[]arr ,int L,int F){
if(L==F){
return;
}
for (int i=L;i<=F-1;i++){
if(arr[i]>arr[i+1]){
int k;
k=arr[i];
arr[i]=arr[i+1];
arr[i+1]=k;
}
}
maoPao(arr,L,F-1);
}
public static void main(String[]args ){
demo d=new demo();
int arr[]={1,7,5,2};
d.maoPao(arr,0,3);
System.out.print(arr[1]);
}
}