Java small algorithm 01 (using recursion to achieve factorial)

Use recursion to implement factorial
Code example:

package com.hao.method;

import java.util.Scanner;

public class Demo08 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N;
        N=scanner.nextInt();
        System.out.print(N+"的阶乘为：");
        System.out.println(factorial(N));

    }
    //阶乘（递归）
    public static int factorial(int N){
        while(N>1){
            return N*factorial(N-1);
        }
        return 1;
    }
}

Sample output: