Is there a software/profiling tool that given an algorithm and a set of inputs gives you the efficiency of the algorithm in terms of O-Notation
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a software/profiling tool that given an algorithm and a set of inputs gives you the efficiency of the algorithm in terms of O-Notation
Big-O describes how the running time (and memory space) of an algorighm scales with inputs of different sizes, so such a tool would have to not accept a particular input.
If you can generate a range of inputs over a range of sizes, feed each input to the algorithm, measure the execution time (and/or memory size), and plot the result, you can then compare it against various possible big-O curves.
I don’t know of any such general symbolic algorithm, and it sounds like a bit of an AI problem. Writing one would be a good exercise. There are probably algorithms which it could not analyze, but it might be able to analyze a useful subset.