Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
adastra22
9mo ago
0 comments
Save
Share
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.
0 comments
2 comments · 1 top-level
top
newest
oldest
justincormack
9mo ago
· 1 in thread
You could use a sorting network too
adastra22
OP
9mo ago
That is, in practice, what I just described.
j
/
k
navigate · click thread line to collapse