Recursion (computer science)
Shortcut rule (master theorem)

If the time-complexity of the function is in the form T (n) = a ⋅ T (n / b) + f (n) {\displaystyle T(n)=a\cdot T(n/b)+f(n)}
change_case:english_lowercase, length_constraints:number_sentences[9]