>>13499809I can see how the first two might need some preparation for, but that seems like material you'd obviously cover in class. Not even knowing very much at all I'd go and guess you can construct an argument that a random digit generator is deterministic by it being a function of some algorithm, which you might be able to generalize for some property that all number generation algorithms share. I haven't done an algorithms class so I don't know but it seems pretty obvious to me that would be the general thrust of how you'd argue. Question 2 isn't so hard depending on the metric. I have a little experience with big O, in which case you'd want to reduce the steps in your programs worst case to its largest term, which is more or less just a way of describing how the computational complexity of the program grows with input size. I'm not really aware of other metrics so it may be a harder question than I'm assuming You have literally no excuse for question 3 though anon, learning to write a recursive fib sequence is literally what everyone learns how to do as a novice.
