Is there a way to calculate approximate running time of an algorithm 11 years ago
I am aware of Big-O notations. For me its just about execution time of an algorithm. I thought it might be possible to calculate it by may be multiplying a bunch of constants.
For instance an algorithm has complexity of O(n).
And input size of 10^6. may be with the number of operations a typical personal computer can perform, we calculate in terms of seconds/milli seconds for a given input.
Well, kind of a very vague numbers I guess... Not trying to get exact numbers. Just curious.