Questions about methods for estimating the increase in runtime of an algorithm as the input size increases.
This question is for analysis of the running time of an algorithm, especially asymptotic running time analysis.
Make sure to refer to our reference questions before asking about the running time of an algorithm:
See especially How to come up with the runtime of algorithms? for a broad overview of the techniques used.
Is there a system behind the magic of algorithm analysis? provides a more systematic treatment of how to take an algorithm and mathematically model its running time.
Solving or approximating recurrence relations for sequences of numbers is helpful when the running time can be expressed as a recurrence relation.
Many elementary questions about running time can be solved using the techniques in those reference questions, so make sure to check whether your problem can be solved using those standard techniques before asking. Questions asking about elementary aspects of runtime analysis (e.g., undergraduate-level exercises) that don't demonstrate knowledge of these techniques might be closed as a duplicate of the reference question.
