Java Recursive algorithm-factorial

Import Java.io.bufferedreader;import Java.io.ioexception;import Java.io.inputstream;import java.io.inputstreamreader;//=================================================//File name:factorial_demo//------ ------------------------------------------------------------------------//author:common//class Name://attribute://Method://Main class//fu Nction:triangle_demopublic class Factorial_demo {public static void main (string[] args) throws exception{//TODO Auto-generated method stub System.out.println ("Input number:"), int thenumber = GETINT (), int theanswer = factorial (thenumber); System.out.println ("factorial:" +theanswer);} public static int factorial (int n) {//recursive if (n = = 1) return 1;elsereturn (N*factorial (n-1));} The output method public static String getString () throws Ioexception{inputstreamreader ISR = new InputStreamReader (system.in); BufferedReader br = new BufferedReader (ISR); String s = br.readline (); return s;} Output method public static int getInt () throws ioexception{string s = getString (); return Integer.parseint (s);}}

Java Recursive algorithm-factorial