Question

merge sort algo takes 30sec for input size of 64 in worst case, then max input size solvabe in 6 minutes?

512     64         1024            2048

Answer 1

Worst case of merge sort = n * log n

For n = 64, it takes 30sec:
     => 30 = k * (64 * log 64)
     => k = 0.078125sec.

Therefore, in 6 min. = 6*60sec. = 360sec.
     => 360 = 0.078125 * n * log n
     => n * log n = 4608
     => n = 512.
 

Comments

plz tell n * log n = 4608 log n^n =4608 now how u got n value? plz elaborate calculation

---

I don't know formal way to do it. I just tried few combinations. Finally, n=2⁹ worked.

---

Substitute the answers in the place of n.