决定数组中两个值的C++递归

#include <iostream>
using namespace std;

// 递归函数声明
bool findTwoValues(int arr[], int size, int value1, int value2, int index = 0, bool foundValue1 = false);

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);
    int value1 = 2;
    int value2 = 5;

    if (findTwoValues(arr, size, value1, value2))
        cout << "Both values found in the array." << endl;
    else
        cout << "One or both values not found in the array." << endl;

    return 0;
}

// 递归函数定义
bool findTwoValues(int arr[], int size, int value1, int value2, int index, bool foundValue1) {
    // 基本情况：如果索引超出数组范围，返回false
    if (index >= size)
        return false;

    // 如果找到第一个值
    if (arr[index] == value1) {
        foundValue1 = true;
    }

    // 如果找到第二个值且之前已经找到第一个值
    if (foundValue1 && arr[index] == value2)
        return true;

    // 递归调用
    return findTwoValues(arr, size, value1, value2, index + 1, foundValue1);
}