This repo will be used to upload the data structures
and algorithms
encoutered in CSC263H1.
Note: the textbook we are using is [CLRS] Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms (3rd ed).
I will try to implement the algorithms using will upload Golang
. If not,Python
implementation instead.
- Priority Queue, Heap
- Binary Search Tree (BST)
- AVL Tree, Augmentation
- Hash Table
- Randomization
- Amortized Analysis
- Graphs, BFS
- DFS
- Minimum Spanning Tree (MST)
- Disjoint Set
- Lower Bounds
Assignment | CLRS |
---|---|
A1Q1 | 2-4 |
A1Q3 | 6.5-8 |
A1Q4 | 6.2 |
A1Q5 | 6-3 |
A2Q2 | Similar to Order-statistic Tree |
A2Q3 | 11.3-3 |
A2Q4 | 11.4-2 |
A2Q5 | 11-1 |
A2Q6 | 9-4 |
A3Q3 | 17.4-3 |
A3Q4 | 17-1 |
A3Q5 | 17-2 |
A3Q7 | BFS |
A4Q1 | 22.4-5 |
A4Q2 | 22-4 |
A4Q5 | 23.1-5 |
A4Q6 | 21.3-4 |
A4Q7 | 21-1 |
Midterm question - Merge k Sorted Lists