Question: This Question is for my Data Structure and Algorithms class, Please help and thank you! 1. Suppose it is known that the running time of
This Question is for my Data Structure and Algorithms class, Please help and thank you!
-
1. Suppose it is known that the running time of an algorithm is 2n2 microseconds, and that the running time of another algorithm for solving the same problem is 200n microseconds, where n is the input size. Which one would you prefer, assuming all other factors equal? Hint: Your choice may depend on n.
2. Could you use these two algorithms to develop an algorithm which works fast for all input sizes?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
