如何在java中实现递归除法

public class RecursiveDivision {
    public static double divide(double dividend, double divisor) {
        // 递归终止条件：当被除数为0时，返回0
        if (dividend == 0) {
            return 0;
        }
        
        // 递归终止条件：当除数为0时，抛出异常
        if (divisor == 0) {
            throw new ArithmeticException("除数不能为0");
        }
        
        // 递归终止条件：当被除数小于除数时，返回0
        if (dividend < divisor) {
            return 0;
        }
        
        // 递归调用：将被除数减去除数，然后递归调用divide函数
        return 1 + divide(dividend - divisor, divisor);
    }
    
    public static void main(String[] args) {
        double dividend = 10;
        double divisor = 3;
        double result = divide(dividend, divisor);
        System.out.println(dividend + " 除以 " + divisor + " 的结果是：" + result);
    }
}