ALGORITHMS

The aim of this repository is to provide an insight about algorithms in general.
You will find here implementation of many popular problems.

Algorithms to be covered

• Binary search
• Selection sort
• Quick sort: Lomuto partition scheme
• Quick sort: Hoare partition scheme
• Breadth-first search
• Dijkstra's algorithm

Data structures to be covered

• Stack
• Queue

Time Complexity

1. Binary search - O(log n)
2. Selection sort - O(n^2)
3. Quick sort - O(n log n)
4. Breadth-first search - O(V + E)