Divide and Conquer

#1

The number of comparisons required to find maximum and minimum in the given array of n- element using divide and conquer.
How to find this? Can you explain the procedure?

#2

hello @ritkumar

we can use tournament algorithm to find min/max in 3n/2 - 2 comparision.

for algorithm u can refer this -> link

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.