examp2_1.java

java 算法设计与分析的好资料.由王晓东先生主编.

//本程序取自王晓东编著“算法分析与设计”第 20 页，例2.2
//Factorial数列的递归解法
import java.io.*;
class Examp2_1
 {
  static long fac(int n)
    {
     if (n==1)
      return 1;
     else
      return n*fac(n-1);
   }
 public static void main(String args[]) throws IOException
  {
   InputStreamReader iin=new InputStreamReader(System.in);
   BufferedReader bin=new BufferedReader(iin);
   int k;
   long f;
   System.out.print("input number k=");
   k=Integer.parseInt(bin.readLine());
   f=fac(k);
   System.out.println("fac="+f);
  }
 }