Useful Formulae

Explore essential formulas to calculate algorithm time complexity, including summations and logarithmic expressions. Understand how these formulas apply to analyzing loops and runtime decisions, preparing you to evaluate efficiency in coding interviews.

We'll cover the following...

Formulas
General Tips

Formulas

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$	$\frac{n(n+1)}{2}$

...

1.Introduction to Complexity Measures

2.Introduction to Arrays

3.Introduction to Linked Lists

4.Introduction to Stack/Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

Useful Formulae

Formulas