In the Divide and Conquer algorithm for finding the maximum and minimum…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

1. A.

   By taking the average of the maximum and minimum values

2. B.

   By comparing the maximum of the left and right subarrays and the minimum of the left and right subarrays

3. C.

   By adding the maximum of the left subarray to the minimum of the right subarray

4. D.

   By multiplying the maximum of the left subarray with the minimum of the right subarray

Attempted by 42 students.

The worked solution is available to enrolled students.