There is a tool to see the algorithms complexity?
Author
hello,
i want to know if there is a program that indicate you the complexity of a algorirhms. Thanks a lot for any reply!
O(n) complexity?
I don't think it's possible/viable, considering that exact bounds don't exist even for some sorting algorithms.
I don't think it's possible/viable, considering that exact bounds don't exist even for some sorting algorithms.
Further, it isn't really necessary. With a little practise you can just judge the typical cases by eye, and the calculations aren't that bad even for the trickier cases (i.e. recursion).
I would suggest picking up a textbook on algorithms - they usually explain the math behind algorithmic complexity in some detail.
I would suggest picking up a textbook on algorithms - they usually explain the math behind algorithmic complexity in some detail.
FWIW, the problem is undecidable in the general case: Rice's Theorem states that for any "non-trivial" property, there does not exist an algorithm that decides whether an arbitrary program has that property.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
