Algorithm Complexity: Difference between revisions
Jump to navigation
Jump to search
Line 14: | Line 14: | ||
Worst case running time. | Worst case running time. | ||
Average case running time. | |||
</font> | </font> |
Revision as of 18:22, 6 August 2018
Internal
Overview
Describe the RAM model that is used for analysis. Instruction set. Memory hierarchy.
Comparing running time for two algorithms of which one is c1n2 and the other is c2 n lg n, even if c2 ≥ c1, no matter how much smaller c1 is than c2, there will always be a crossover point beyond which the c2n lg n algorithm is faster.
Best case running time.
Worst case running time.
Average case running time.
Recurrence
The running time of recursive algorithms can be analyzed using recurrences.
A method of analyzing running time of recursive algorithms is the "master theorem".