I understand that it is possible to analyse code and manually calculate the time complexity of an algorithm by hand and then determine the Big O notation. However I am curious if an algorithm exists to automatically compute this problem.
Asked
Active
Viewed 33 times
1
-
2Very likely there is no such algorithm as I assume you can reduce this to the halting problem: https://en.wikipedia.org/wiki/Halting_problem – michid Mar 02 '21 at 12:08