Archive for December, 2007

Measuring Complexity of an Executable!

December 31, 2007 4 comments

For the time being, I have an interesting question to share rather ask 🙂

When ever we do the Asymptotic Analysis, we are given the source code or algorithm of a problem and we measure the run time complexity in terms of Big O, Big Omega etc…by doing the line to line analysis of the code.

Now the question is, lets say we are given an executable containing the code of a given problem (lets assume a sorting or searching algorithm), now how will we find the complexity of the executable i.e the asymptotic complexity? means is it taking linear, quadratic or exponential time etc…

Do try to think on this, it’s small but interesting question..