Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Hexstream
on Jan 28, 2009
|
parent
|
context
|
favorite
| on:
What real life bad habits has programming given yo...
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?
_zmin
on Jan 28, 2009
[–]
How do you figure?
Hexstream
on Jan 28, 2009
|
parent
[–]
Does walking continuously for 1000km merely take 100 times longer/more effort than 10km?
paulgb
on Jan 29, 2009
|
root
|
parent
[–]
Good point, but you answered your own question: the "walk then rest" algorithm will do it in linear time.
tjpick
on Jan 29, 2009
|
root
|
parent
[–]
null pointer on your drink-bottle instance results in fatal runtime exception.
paulgb
on Jan 29, 2009
|
root
|
parent
[–]
Pun intended?
tjpick
on Jan 29, 2009
|
root
|
parent
[–]
da-da-chhhhh. you're quick ;)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
