Question: If a sorting algorithm takes n^2 operations, and the computer can perform 10 billion operations per second, what is a reasonable estimate of how long
If a sorting algorithm takes n^2 operations, and the computer can perform 10 billion operations per second, what is a reasonable estimate of how long it will take to sort 1 billion elements (assuming there is ample memory, the computer doesn't crash, etc.)?
Options are - A) 3 Seconds. B) 3 Hours. C) 3 Days. D) 3 Years. E) 3 Decades. F) 3 Centuries
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
