Assume that a mergesort algorithm in the worst case takes 30 seconds for an…
PYQ GATE 2015
Assume that a mergesort 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?
- A.
256
- B.
512
- C.
1024
- D.
2048
Attempted by 489 students.
Sign up free to check your answer
Sign up freeLoading lesson…