在Java中递归地查找数组中的数字总和

public class RecursiveSum {

    public static int getSum(int[] arr) {
        return getSumHelper(arr, 0, arr.length - 1);
    }

    private static int getSumHelper(int[] arr, int start, int end) {
        // Base case: when start and end pointers cross each other
        if (start > end) {
            return 0;
        }

        // Recursive case: divide the array into two halves
        int mid = (start + end) / 2;
        int leftSum = getSumHelper(arr, start, mid);
        int rightSum = getSumHelper(arr, mid + 1, end);

        // Combine the results from the two halves
        return leftSum + rightSum + arr[mid];
    }

    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        int sum = getSum(arr);
        System.out.println("Sum: " + sum);
    }
}