Algorithm Complexity: Difference between revisions
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
The running time of [[Data Structures and Algorithms#Recursive_Algorithm|recursive algorithms]] can be analyzed using recurrences. | The running time of [[Data Structures and Algorithms#Recursive_Algorithm|recursive algorithms]] can be analyzed using recurrences. | ||
<font color=darkgray>A method of analyzing running time of recursive algorithms is the "master theorem".</font> | <font color=darkgray>A method of analyzing running time of recursive algorithms is the "master theorem".</font> | ||
Revision as of 03:32, 5 August 2018
Internal
Overview
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".