Could it be done by keeping a counter to see how many iterations an algorithm goes through, or does the time duration need to be recorded?
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.
Could it be done by keeping a counter to see how many iterations an algorithm goes through, or does the time duration need to be recorded?
Algorithm complexity is defined as (something like:)
So you need to try your algorithm with various input sizes (i.e. for sort – try sorting 10 elements, 100 elements etc.), and count each operation (e.g. assignment, increment, mathematical operation etc.) the algorithm does.
This will give you a good “theoretical” estimation.
If you want real-life numbers on the other hand – use profiling.