Wallis函数在Java中的递归实现

public class WallisFunction {
    public static double wallis(int n) {
        if (n == 0) {
            return 1.0;
        } else {
            double numerator = 2 * n;
            double denominator = 2 * n - 1;
            return (numerator * numerator) / (denominator * (denominator + 2)) * wallis(n - 1);
        }
    }

    public static void main(String[] args) {
        int iterations = 1000000;
        double piApproximation = 2 * wallis(iterations);
        System.out.println("Approximation of pi using Wallis function: " + piApproximation);
    }
}