Post by David LimIs there any tool or plugin that we can use to test the runtime
efficiency of our algorithms in terms of big-Oh notation?
As stated in the class, big-Oh bounds are used to express (theoretical)
asymptotic bounds of code fragments (e.g., methods, algorithms).
Measuring the actual run-time performance in terms of time depends on many
other factors such as the CPU speed, load factor, code optimization, etc.
As we cannot control or predict these underlying factors, we cannot
provide you with a tool that could be used to verify that some code
fragment is implemented efficiently or as specified.
Igor