Question: Give a recursive implement to the following functions: a. int sumOfSquares(int arr[], int arrSize) This function is given arr, an array of integers, and its
Give a recursive implement to the following functions:
a. int sumOfSquares(int arr[], int arrSize)
This function is given arr, an array of integers, and its logical size, arrSize. When called,
it returns the sum of the squares of each of the values in arr.
For example, if arr is an array containing [2, -1, 3, 10], calling sumOfSquares (arr, 4) will return 114 (since, 22 + (-1)2 + 32 + 102 = 114).
b. bool isSorted(int arr[],int arrSize)
This function is given arr,an array of integers,and its logical size,arrSize.When called,it should return true if the elements in arr are sorted in an ascending order,or false if they are not true.
In C++
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
