aboutsummaryrefslogtreecommitdiff
path: root/Tasks.org
diff options
context:
space:
mode:
Diffstat (limited to 'Tasks.org')
-rw-r--r--Tasks.org9
1 files changed, 9 insertions, 0 deletions
diff --git a/Tasks.org b/Tasks.org
index 649edcb..9d034d1 100644
--- a/Tasks.org
+++ b/Tasks.org
@@ -122,6 +122,15 @@ For example, insert grows linearly for linked lists, but goes down to 0 for vec.
We implement several test programs which require different data structures and different implementations.
We compare our results to the best possible result, and to using the standard library implementation.
+Ideas:
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2021/day9/09.cpp?ref_type=heads
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2022/src/day05.rs?ref_type=heads
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2022/src/day08.rs?ref_type=heads
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2022/src/day09.rs?ref_type=heads
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2022/src/day11.rs?ref_type=heads
+ - https://git.tardisproject.uk/tcmal/advent-of-code/-/blob/main/2022/src/day14.rs?ref_type=heads
+ - Dijkstra's
+
* BLOCKED Nice to haves
- Better intermediate outputs, possibly export plots?