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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Spatial Database Systems Design Implementation And Project Management
Authors: Albert K.W. Yeung, G. Brent Hall
1st Edition
1402053932, 978-1402053931
