undefined | Better HN

0 pointsadastra226mo ago0 comments

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

You could use a sorting network too

That is, in practice, what I just described.

j / k navigate · click thread line to collapse

0 pointsadastra226mo ago0 comments

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.

You could use a sorting network too

That is, in practice, what I just described.

j / k navigate · click thread line to collapse