/**
*JieCheng.java
*
* @author LiFangHai
*
* @version 1.00 2010/8/18
*/
public class JieCheng {
public int first(int val) {
if(val > 1)
{
return val *= this.first(val-1);
}else{
return 1;
}
}
public int second(int val)
{
int ab = val;
while(val>=1)
{
if(val==1)
{
ab*=1; break;
}
else
{
ab *= (val-=1);
}
}
return ab;
}
public static void main (String[] args) {
System.out.println ("用递归求10! ="+ new JieCheng().first(10));
System.out.println ("*************");
System.out.println ("用循环求10!="+ new JieCheng().second(10));
}
}
分别用递归方式和循环法方式实现求阶乘算法!