Algorithms

This repository will help to understand the algorithms and data structures in a programmatic manner.

Growth of functions:

• O(1) Add an element to an array
• log n(also log₂n) - Binary search(Divide and conquer method)
• n - Linear search
• n logn - Quick sort
• n² - Bubble sort
• 2ⁿ - Value is 1024
• n! - 10! Value is 3million

---

Links for reference:

• All complexities such as complexity log(n) and n (log(n))
• Big O Notations

[Graph representation|https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/tutorial/]