Question

C++ Programming

A. (10 Points) Recursive Minimum Write a recursive method that computes the minimum element of an array Hint: The minimum value in an array is either the first element, or the minimum number in the rest of the array, whichever is smaller.

please answer both questions and if anyone knows the source of this questions (Book, Website, ...) please let me know. thanks

Answer 1

$\color{blue}\underline{1:}$

#include <iostream>

using namespace std;

int max(int arr[], int size) {
    if (size == 1) {
        return arr[0];
    } else {
        int large = max(arr, size - 1);
        if (arr[size - 1] > large)
            large = arr[size - 1];
        return large;
    }
}

int main() {
    int arr[] = {4, 2, 9, 5, 7};
    cout << max(arr, 5) << endl;
    return 0;
}

$\color{blue}\underline{2:}$

#include <iostream>

using namespace std;


void countUp(int n) {
    if (n >= 1) {
        countUp(n - 1);
        cout << n << endl;
    }
}

int main() {
    countUp(5);
    return 0;
}