Notes :
- Lec1 (MIT OCW 6.006) https://gist.github.com/mr-karan/3977046543ea78e628b1
ToDo :
- Insertion Sort
- Merge Sort
- Heap Sort
- BST
- AVL Sort
- Knapsack Problem {0,1}
- Minimum Spanning Tree kruskal's/prim's
- Counting Sort
- Radix Sort
- Djisktras shortest path
- Tree Vertex Splitting problem