Hacker News Reader

Walking would be O(n^2) for all but the shortest distances actually, I think. Unless you rested once in a while. Amortized linear time?

How do you figure?

Does walking continuously for 1000km merely take 100 times longer/more effort than 10km?

Good point, but you answered your own question: the "walk then rest" algorithm will do it in linear time.

null pointer on your drink-bottle instance results in fatal runtime exception.

Pun intended?

da-da-chhhhh. you're quick ;)