Chapter 3, Problem 16C

Explanation of Solution

Program code:

//include the header files

#include <iostream>

//use the std namespace

using namespace std;

// function to return Minimum element 

int findMin(int A[], int n)

{

// if size = 1 means whole array has been traversed

if (n == 1)

//return A[0]

return A[0];

// recursive call

return min(A[n-1], findMin(A, n-1));

}

// function to return Maximum element

int findMax(int A[], int n)

{

// n = 1 means whole array has been traversed

if (n == 1)

//return A[0]

return A[0];

// recursive call

return max(A[n-1], findMax(A, n-1));

}

//define main() function

int main()

{

// initializing array

int A[] = {5,6,4,7,3,8,2,9};

// calculating size of array

int...