Terms

Amortized time complexity

The motivation for amortized analysis is that looking at the worst-case run time per operation, rather than per algorithm, can be too pessimistic

Master theorem

T(N) = O(N) + T(0) + T(N-1) = O(N ^ 2)
T(N) = O(N) + 2T(N/2) = O(N * LogN)