Suppose Algorithm A performs n basic operations when given an input of size n, while Algorithm B performs n 2 basic operations and Algorithm C performs n 3 basic operations. Suppose that your computer takes 1 nanosecond to perform a basic operation. What is the largest problem size each can solve in 1 second, 10 minutes, and 1 hour
the answer isn’t:
what do you know?
yes you can very simple, click the heart and then click the follow requests button.
it would be a. excessive network collisions or d. slow connectivity between devices those would be my answer.