I can’t understand
what is ceil(3n/2) and floor and what is
T(n) = T(floor(n/2)) + T(ceil(n/2)) + 2
T(2) = 1
T(1) = 0
I can’t understand how to solve the below problem
what is ceil(3n/2) and floor and what is
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 don’t understand how is your query related to the tiling problem - II
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.