Hi readers! This post is going to be a placeholder for an overview of what I am going to cover in this blog (hopefully). Actually the reason I am doing this is because I will be having a test this Friday, and I need to do a review of what I have already learnt so far. Thus, the title.
Algorithms covered:
- Binary Search
- Sorting (Bubble, Insertion, Selection, Merge, Quick, Counting, Radix, Topo)
- Binary Search Tree (Trees)
- Bellman-Ford Algo (Graphs)
- Dijkstra's Algo (Graphs)
- BFS and DFS (Graphs)
- Bloom Filters (Hash table)
Data structures:
- LinkedList
- Trees, especially AVL Tree
- Graphs, both directed and undirected but no multi-graph
- Heap, especially Binary Heap
- Heaps Union Find
- Hash tables - Chaining vs Open Addressing
These are not everything I have learnt, but I omitted some that is quite obvious (like ArrayList, or even a plain Array) or things that is not covered in great detail in class (Red-Black trees or something, Fibonacci Heap, etc)
Sorry I have much lesser time that I thought I would have. Hopefully I can fill this blog during the summer (though I doubt so because I have already some plans in mind for summer, though those are not confirmed yet).
