Yet another puzzle which first part does not require R programming, even though it is a programming question in essence: Given five real numbers x1,…,x5, what is the minimal number of pairwise comparisons needed to rank them? Given 33 real numbers, what is the minimal number of pairwise comparisons required to find the three largest ones? […]