Module 2: Fundamentals of Analysis of Algorithm Efficiency Flashcards
1
Q
Plot running time T(N) vs. input size N.
A
Standard Plot
2
Q
Plot running time T(N) vs input size N using log-log scale.
A
Log-log Plot
3
Q
Sum of cost x frequency for all operations.
A
Total running time
4
Q
Cost dependents on machine, _____?
A
Compiler
5
Q
Frequency depends on algorithm, _____?
A
Input data
6
Q
THe small set of functions 1(constant), log n(lagorithmic), n(linear), n log n(lenearithmic), n^2(quadratic), n^3(cubic), and 2^n(exponential). Suffices to describe the order-of-growth of typical algorithms.
A
Common Order-Of-Growth Classifications
