Useful Formulas

Explore key mathematical formulas that help evaluate the time complexity of algorithms, including summations and logarithmic properties. Understand how to apply these to analyze iterative and recursive code for efficient programming and interview success.

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 Lists

3.Introduction to Linked Lists

4.Introduction to Stacks and 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 Formulas

Formulas