Big-O Lecture list

1. Dynamic Array and String
2. Algorithmic Complexity
3. Sorting
4. Stack and Queue
5. BFS
6. DFS
7. Heap
8. Dijkstra Algorithm
9. Midterm Exam
10. Bellman-Ford Algorithm
11. Floyd-Warshal Algorithm
12. Binary Search
13. Binary Search Tree
14. Trie
15. Prim's Algorithm
16. Disjoint Set Union
17. Final Exam