time complexity for a given plot

Hi,

I want to give the time complexity for a specific algorithm. I computed the time it requires to execute the algorithm for different size of inputs.

for n=10 it takes 0.30 seconds, for n=20 0.41 seconds ,for n=40 0.87 sec, n=80 4.9 sec etc.

My question: How can I in general, give the time complexity in O notation for such a given plot representing the time it requires for different size of inputs ?

Answer 1

[Prudhvi Peddagoni]

Hi Mathematica,

You can plot the graphs of Y=, Y= and Y=X with your data (n vs time ) and compare which pattern it is following.

documentation for the plot function can be found here.

For more accurate results, time complexity will have to be calculated using theoretical methods.

Hope this helps.