Question: If an algorithm takes n^2 operations, and the computer can perform 100 billion operations per second, what is a reasonable estimate of how long it

If an algorithm takes n^2 operations, and the computer can perform 100 billion operations per second, what is a reasonable estimate of how long it will take to sort 2 billion elements (assuming there is ample memory, the computer doesn't crash, etc.)? Selected answer will be automatically saved. For keyboard navigation, press up/down arrow keys to select an answer.

a 1 second

b 1 minute

c 1 hour

d 1 day

e 1 month

f 1 year

g 1 decade

h 1 century

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!