Question: Alice wrote a new algorithm that works in O(n 3 ) where n can be at most 10 6 . Bob told Alice that it
Alice wrote a new algorithm that works in O(n3) where n can be at most 106. Bob told Alice that it will take years to finish in the worst case. Do you agree with Bob? If yes, then approximately how many years will it take to finish? Assume Alices computer can run 109 instructions in 1 second.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
