Do you see the answer?
Hey my uni lecturer has set a question as follows -
Solve the following recurrance relation:
W(n) = W(n-1) + 3
W(0) = 1
I haven't a baldy what he wants. I think the W mean worst case analysis, but that's all I know about it! Anybody want to give it a go?