https://github.com/ronylee11/heap-dijkstra-knapsack
https://github.com/ronylee11/heap-dijkstra-knapsack
Last synced: over 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/ronylee11/heap-dijkstra-knapsack
- Owner: ronylee11
- License: gpl-3.0
- Created: 2023-12-15T02:26:49.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-01-28T12:42:55.000Z (over 2 years ago)
- Last Synced: 2025-02-08T16:45:46.554Z (over 1 year ago)
- Language: C++
- Size: 73.2 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Algorithm
Q1: Numeric seeding with ID
Q2: Heap Sort, Merge Sort
Q3: Shortest Paths, Minimum Spanning Tree
Q4: Dynamic Programming
## Task Distribution
| 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 |
## How to run this program?
To Run Q2, Heap Sort and Merge Sort
```
g++ Dataset1.cpp -o Dataset1 && ./Dataset1
```
To Run Q3, Q4
```
g++ Dataset2.cpp -o Dataset2 && ./Dataset2
```