I have an algorithm and I determined the asymptotic worst-case runtime, represented by Landau notation. Let's say $T(n) = O(n^2)$; this is measured in number of operations.But this is the worst case, how about in average? I tried to run my algorithm 1000 times for each $n$ from $1$ to $1000$.I get another graph which is the average running time against $n$ but measured in real seconds.Is there any possible way to compare these figures?
Compare asymptotic WC runtime with measured AC runtime
algorithm analysis;asymptotics;runtime analysis;average case