4 ms·
We just had our second a few weeks ago, and to figure out some names, we each got a big list of "kind of like this name," totally casual and noncommittal, and c
by Amorymeltzer 5y ago
We just had our second a few weeks ago, and to figure out some names, we each got a big list of "kind of like this name," totally casual and noncommittal, and combined them. We then used a little Elo[1] rater script I whipped up to compare items, it was fun! Once you get a short list there's no good algorithm to figure it out, but using Elo we both found names we loved that we never would have thought about, and had a fun time doing so.
1: https://en.wikipedia.org/wiki/Elo_rating_system https://en.wikipedia.org/wiki/Elo_rating_system
- hamaluik 5y agoCongrats! Elo rating is a good idea for sorting.. I just implemented an insertion sort to help rank names which works but also feels a bit awkward.
- remram 5y agoYour sort has a way higher complexity than required, in terms of comparisons. It will present the user with way more pairs than the optimal system would, which will make it very hard to sort through a longer list. You might want to use a merge insertion sort instead. See https://stackoverflow.com/a/53979250/711380 https://stackoverflow.com/a/53979250/711380 Of course this only works if you assume the order is total, which is actually a good assumption unless multiple people are contributing to the same ranking (in that case use ELO).
- hamaluik 5y agoHmm, that is a good idea; thanks. I don't have a CS degree so this is one of those areas where I don't know what I don't know.
- remram 5y agoOn an intuitive level, if I just said I prefer "Alice" to "Anna", and "Anna" to "Mary", it should not ask whether I prefer "Alice" to "Mary". In practice that seems a little bit difficult and I was hoping someone would jump with the optimal solution.