Question: Consider the following recursive algorithm, AddOne(A[],n) , that takes as arguments an array A of n integers, and add 1 to every element in A.
- Consider the following recursive algorithm, AddOne(A[],n), that takes as arguments an array A of n integers, and add 1 to every element in A. So for instance, if A = [1, 3, 2, 9, 5, 4], calling AddOne(A,6) should result in A = [2, 4, 3, 10, 6,5].AddOne(int A[] , int n){
// you can assume that the array A is not empty...
If (n ==1)
A[0] = A[0]+1
else
A[n-1] = A[n-1] + 1;
AddOne(A, n-1)
}
- Use similar approach to write a REURSIVE algorithm that uses the reduce-and-concur approach to add all the elements in the array. PYTHON PLEASE
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
