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.
I need to make some benchmarks of few sorting algorithms and compare there performances.
So what I need to ask is are there any tools out there which will help to monitor Program’s time and space complexity.
I did tried to find on Google but search results not leading me to proper direction.
Thanx in advance.
As @OliCharlesworth already pointed out, your question has nothing to do with time/space “complexity”: the time complexity is an asymptotic measure of how many steps your algorithm takes in an ideal computational model, like the RAM machine or the Turing one.
What you really want to do is just to measure the amount of time and space taken by the concrete implementation of your algorithm. This, of course, depends on which language you are using to do that.
If you are using something which compiles to executables, you might be interested in the Valgrind suite of tools, in particular Massif (memory profiler) and Callgrind (time profiler).