Least number of comparisons to identify 6 numbers with values from 1 to 6 (without repetition)
According to Wikipedia, the minimum number of comparisons needed to sort 6 numbers is 10. The lower bound follows from the usual decision tree argument.