The number of comparisons required to find maximum and minimum in the given array of n- element using divide and conquer:
ciel(3n/2)
ciel(3n/2)+2
floor(3n/2)
floor(3n/2)-2
i have understood the recurrence relation for finding max and min using divide and conquer
i.e. T(n)=T(floor(n/2))+T(ceil(n/2))+2
but how to find the number of comparisons using this recurrence relation?
Hey @Rj.25, I am not getting where you are finding issue at. Is it understanding question, or how to code this approach?
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.