2 ms·
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 re
by adastra22 1y 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.
- justincormack 1y agoYou could use a sorting network too
- adastra22 1y agoThat is, in practice, what I just described.