Question: Q 1 : Assume that a Merge sort algorithm in the worst case takes 3 0 seconds for an input of size 6 4 .

Q1: 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 160 seconds?
a.256
b.1024
c.2048
d.512
 Q1: Assume that a Merge sort algorithm in the worst case

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!