Q1: Numeric seeding with ID
Q2: Heap Sort, Merge Sort
Q3: Shortest Paths, Minimum Spanning Tree
Q4: Dynamic Programming
| Num | Student ID | Student Name | Task descriptions | Percentage % |
|---|---|---|---|---|
| 1 | 1211311027 | LEE RONG YI | Q1, Q4 | 34 |
| 2 | 1211307001 | CHAN KAH KEI | Q1, Q2 | 33 |
| 3 | 1211306086 | VIVIAN WEE GEK TING | Q1, Q3 | 33 |
To Run Q2, Heap Sort and Merge Sort
g++ Dataset1.cpp -o Dataset1 && ./Dataset1
To Run Q3, Q4
g++ Dataset2.cpp -o Dataset2 && ./Dataset2