Question: 8. Design an efficient divide and conquer algorithm for finding the number of odd values and the number of even values in a given array

8. Design an efficient divide and conquer algorithm for finding the number of odd values and the number of even values in a given array of integers. Find a formula for the number of comparisons the algorithm performs using either forward or backward substitution. Prove your answer using induction for n=2k
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
