Hello,
Is there a memory limitation for our algorithm?
Because if we are not bounded, then the trivial solution takes only O(1)* (2k+t) time, which is better than O(k*log(t))* (2k+t).
HW 2 Q2a
Example Exam - revised version and solutions
Edited Q1a and Q2c
(23 Jun 2019 07:19)
Example Exam
Solutions will be posted by Monday next week.
(20 Jun 2019 19:09)
Exam header
So that you don't need to waste time on instructions during the exam.
(11 Jun 2019 18:45)