Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Locating the Source of a Mysterious Beep. Parent comment
O(log n) is if you can split the collection in half in an O(1) step, like, *shoving* the whole pile together as a unit
O(n) if you're moving items one at a time. So, splitting the pile in half is O(n)
O(n^{3/2}) if the project is growing out of control and walking distances start to matter
O(n^{4/3}) if that, but somehow it's taking place in 3-dimensions
There are no comments on this comment yet.
O(log n) is if you can split the collection in half in an O(1) step, like, *shoving* the whole pile together as a unit
O(n) if you're moving items one at a time. So, splitting the pile in half is O(n)
O(n^{3/2}) if the project is growing out of control and walking distances start to matter
O(n^{4/3}) if that, but somehow it's taking place in 3-dimensions