Search⌘ K

Useful Formulae

Explore essential formulas used to calculate algorithm time complexities such as summations of constants, arithmetic series, squares, and geometric series. Understand general patterns like linear, logarithmic, and quadratic time complexities to sharpen your skills in measuring algorithm efficiency.

We'll cover the following...

Formulae

Here is a list of handy formulas which can be helpful when calculating the Time Complexity of an algorithm:

Summation
Equation
(i=1nc)=c+c+c++c\left(\sum_{i=1}^n c \right) = c + c+ c + \cdots + c
cncn
(i=1ni)=1+2+3++n\left(\sum_{i=1}^n i \right) = 1+2+3+\cdots+n
...