time complexity

amana

is there any algorithm that can find time complexity of any program(recursive or non recursive)?

JosAH

Quote:

Originally Posted by amana

is there any algorithm that can find time complexity of any program(recursive or non recursive)?

No there isn't and the proof is analogous to the Turing Halting Problem proof:

suppose you have such an algorithm A(P) such that A(P) == O(f(n)) which indicates the big-Oh value of P. Consider this P:

P(n): if A(P) == O(n) then do something O(2^n) else do something O(n)

kind regards,

Jos

time complexity

re: time complexity

Similar Algorithms / Advanced Math bytes

/bytes/development

/bytes/it

/bytes/about