'Is there an algorithm which adaptively minimizes the number of comparisons between items?
Suppose you want to sort a list based on human input of pairwise preferences (assume their preferences are transitive). Let's assume that computational cost doesn't matter, and all you care about is minimizing the number of queries to the user. What's the best you can do? (In terms of actual worst case or average case number of comparisons, not just asymptotically).
Is the best option to just run something like Timsort using the user inputs? It seems like you should be able to do some more intelligent selection of queries using your extra compute, but maybe not.
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|