in reply to Algorithm complexity
I do not think what you want is possible(or at least I haven't read of anything that proves it is). However , you may try your luck with the following idea:
The big O notation refers to classes of function growth, if you are able to measure the time it takes for your algorithm to finish for a reasonable number of values you can make a plot. If you are able to see which classes of functions that plot is most similar to then you are able to approximate where the big O notation will be. Again, this is in no way a rigorous solution, it might work on some problems though ... good luck.
|