Question: 3. (5 points): A certain divide-and-conquer algorithm takes O(n log n) time. If it runs in 1 second on an input of size one thousand,

3. (5 points): A certain divide-and-conquer algorithm takes O(n log n) time. If it runs in 1 second on an input of size one thousand, how long, approximately, will it take on an input of size one million
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
