Y
Hacker News
new
|
ask
|
show
|
jobs
by
adastra22
265 days ago
Tell them to make sure the person in front of them has a birthday before theirs. If not, keep jumping back the line until they do.
Practical CS theory isn’t really relevant here because it is N-parallel for N people.
1 comments
justincormack
264 days ago
You could use a sorting network too
link
adastra22
264 days ago
That is, in practice, what I just described.
link