### Hash

- Separate chaning
- Linear Probing
- Quadratic Probing
- Double Hashing
- Cuckoo Hashing

### Graph Algorithm

- Graph
- Topology Sort
- Unweighted Shortest path
- Dijkstea's Shortest path
- Prim's minimum spanning tree
- Kruskal's minimum spanning tree
- Biconnected Component
- Euler path - Euler circuit
- Max Flow
- Strongly connected components

Preformance of algorithm are not comparable from appearence.

Random inputs are integer from 1 - 1000 which will cause some effect to algorithm outcome.