Hello class.
The first quiz grades are now posted.
As I went over in class, when you are given an algorithm to analyze for time and space complexity, I expect you to explain how you arrive at the values and show calculations. The answers must always be relative to input with input size represented by n.
For example, for worst case scenario I expected at minimum something like:
if size of dlist is n, then num is n and that makes border function time complexity O(n) since the loop repeats n times with constant body. Then in printl we have call to border O(n) + loop n times with constant body so O(n) + another call to border O(n) = O(3n) which makes the final growth rate linear O(n)