given - An algorithm takes 0.5ms for input size 100. How long will it take for input size 500 (assuming that the lower-o
Posted: Sat Feb 19, 2022 3:22 pm
given - An algorithm takes 0.5ms for input size 100. How long
will it take for input size 500 (assuming that
the lower-order terms are negligible) if the running time of the
algorithm is O(1)? O(n)? O(n^2)? O(n^3)?
?
will it take for input size 500 (assuming that
the lower-order terms are negligible) if the running time of the
algorithm is O(1)? O(n)? O(n^2)? O(n^3)?
?