Useful Formulae

Explore fundamental formulae used to calculate algorithm time complexity, including sums of constants, linear and quadratic sequences, and geometric series. Understand how these formulas help estimate the efficiency of iterative and nested loops, and common patterns like halving input size, to prepare for complexity measures in coding interviews.

We'll cover the following...

Formulae
General Tips

Formulae

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

Summation	Equation
$\left(\sum_{i=1}^n c \right) = c + c+ c + \cdots + c$	$cn$
$\left(\sum_{i=1}^n i \right) = 1+2+3+\cdots+n$

...

1.Introduction

2.Algorithmic Paradigms

3.Introduction to Complexity Measures

4.Sorting & Searching

5.Graph Algorithms

6.Greedy Algorithms

7.Dynamic Programming

8.Divide and Conquer

9.Appendix: Auxiliary Source Code

10.Conclusion

Useful Formulae

Formulae