Useful Formulae

Explore useful mathematical formulas to calculate the time complexity of algorithms, including summations and logarithmic expressions. Learn practical tips to recognize complexity patterns like linear and logarithmic time. This lesson equips you with foundational tools to analyze and compare algorithm efficiency in JavaScript 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