package h.classroompratise;
/*作者:陈天祥
时间:2016.10.11
功能:递归方法使用*/
public class recurSion {
//public static double sum=200;
// public static double high=100;
public static void main(String[] args) {
// TODO Auto-generated method stub
int index=1;
double sum=0;
double high=0;
m(index,sum,high);
}
public static void m(int index,double sum,double high){
//index++;
if(index== 1) {
high=100;
sum=200;
}else {
sum += 2*high;
high=high/2; /*第n次反跳高度*/
}
// index++;
// m(index,sum,high);
if(index==10)
{ System.out.println("the sum is:"+sum);
System.out.println("the high is:"+high);
return;
}
index++;
m(index,sum,high);
}
}
/*作者:陈天祥
时间:2016.10.11
功能:递归方法使用*/
public class recurSion {
//public static double sum=200;
// public static double high=100;
public static void main(String[] args) {
// TODO Auto-generated method stub
int index=1;
double sum=0;
double high=0;
m(index,sum,high);
}
public static void m(int index,double sum,double high){
//index++;
if(index== 1) {
high=100;
sum=200;
}else {
sum += 2*high;
high=high/2; /*第n次反跳高度*/
}
// index++;
// m(index,sum,high);
if(index==10)
{ System.out.println("the sum is:"+sum);
System.out.println("the high is:"+high);
return;
}
index++;
m(index,sum,high);
}
}