Programmatically obtaining Big-O efficiency of code

Question

I wonder whether there is any automatic way of determining (at least roughly) the Big-O time complexity of a given function?

If I graphed an O(n) function vs. an O(n

Answer 1

Jeffrey L Whitledge is correct. A simple reduction from the halting problem proves that this is undecidable...

ALSO, if I could write this program, I'd use it to solve P vs NP, and have $1million... B-)