Presently we can solve in our hypothetical machine problem instances of size 100 in 1 minute
using algorithm A, which is a O(2n). this is 2 to power n
We would like to solve instances of size 200 in 1 minute
using algorithm A on a new machine. What is the speed of the new machine should be?
:-O
There's no way to answer that question with guaranteed accuracy. Also, write 2 to the n as 2^n, definitely not as 2n.
What do you think big O notation means?
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.