Question: Big Oh. Joe Smoe wrote a method to evaluate his Steiner Tree class. The method is O(n 2 ) where n is the number of
Big Oh. Joe Smoe wrote a method to evaluate his Steiner Tree class. The method is O(n2) where n is the number of vertices in the tree. When n = 1,000 his program takes 35 time units. How long would you expect the program to take when n = 5,000?
I need help in answering this question and also how to solve problems like this in general.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
