In the Divide and Conquer algorithm for finding the maximum and minimum…
Bihar STET 2025
In the Divide and Conquer algorithm for finding the maximum and minimum elements, how are the results from the left and right subarrays combined?
- A.
By taking the average of the maximum and minimum values
- B.
By comparing the maximum of the left and right subarrays and the minimum of the left and right subarrays
- C.
By adding the maximum of the left subarray to the minimum of the right subarray
- D.
By multiplying the maximum of the left subarray with the minimum of the right subarray
Attempted by 391 students.
Sign up free to check your answer
Sign up freeLoading lesson…

