Hello, I am trying to understand how to solve problems relating to time complexity of algorithms, esp. problems of the following kind:(adsbygoogle = window.adsbygoogle || []).push({});

An algorithm takes 0.5 ms for input size 100. How long will it take

for input size 500 if the running time is the following:

linear, nlogn, n^2, N^3

An algorithm takes 0.5 ms for input size 100. How large a problem

can be solved in 1 min if the running time is the following:

linear, nlogn, n^2, n^3

I think I have a general idea of what is asked but cannot figure out how to find it mathematically. Could someone be kind enough to explain it step by step?

Appreciate your help.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Calculating complexity

**Physics Forums | Science Articles, Homework Help, Discussion**