Assume that a merge sort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

#1

How is it 512? explain

#2

Time complexity of merge sort is Θ(nLogn)

c64Log64 is 30
c64*6 is 30
c is 5/64

For time 6 minutes

5/64nLogn = 660

nLogn = 72*64 = 512 * 9

n = 512.

i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved :grinning:
if you have more doubts regarding this feel free to ask

#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.