1. Profiling is the process of measuring an algorithm’s performance, by counting instructions and/or timing execution. In this case study, we develop a program to profile sort algorithms.
2. Timing an algorithm with different problem sizes
a can give you a general idea of the algorithm’s run-time behavior
b can give you an idea of the algorithm’s run-time behavior on a particular hardware platform and a particular software platform
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here