merge sort int the worst case takes 30 seconds for the input size 64. which of the following most closely approximates the maximum size of a problem that can be solved in 6 mintues?
Sorting quiz question no. 1
Hello @animeee_13,
The worst case time complexity of merge sort is Θ(nLogn) = c*(nLogn).
Where, c is some constant.
c*64Log64 = 30
c*64*6 = 30
c = 5/64
For time 6 minutes
5/64*nLogn = 6*60
nLogn = 72*64 = 512 * 9
n = 512
Hope, this would help.
Give a like if you are satisfied.
1 Like
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.