Is there any software that analyzes the complexity of an algorithm?

Asked

Viewed 568 times

1

is there any software that does the complexity analysis of an algorithm? if yes, I would like to know which

java algorithm recursion

  • I will not guarantee up because to do something partial is possible and may exist but a thorough analysis and that solves all situations is very complicated or impossible. There are tools that help analyze.

  • Jdepend - for java Ndepend - for . Net

  • is a simple algorithm, nothing complex, you can cite what are these tools?

  • 3

    Cyclomatic analysis is not algorithm complexity. @Josemaximilian I don’t know any, these were quoted above doesn’t do what you want, it’s another matter. Cyclomatic analysis is very easy to obtain but it is very simple. Its purpose is to analyze code and not algorithm.

  • May I have understood the wrong question, what would be the purpose of the question? would be cost of running the algorithm? I believe that the cyclomatic analysis can measure the complexity of the algorithm depends on the point of view. I currently have an architecture requirement that a method cannot have more than 5 points, and I’ve always called it algorithm complexity.

  • 3

    @Douglasmendes Cyclomatic complexity has nothing to do with Algorithmic complexity.

Show 1 more comment

1 answer

1

I know two good options that allow a static analysis of code and that include, the CC: sonarqube and Stan (http://stan4j.com/)

Browser other questions tagged java algorithm recursion

You are not signed in. Login or sign up in order to post.