Timeline for Rank the Fencers
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2016 at 4:59 | comment | added | thepace | Corrected the worst case calculation. | |
| Jan 6, 2016 at 4:59 | history | edited | thepace | CC BY-SA 3.0 |
added 3 characters in body
|
| Jan 5, 2016 at 15:44 | comment | added | Fimpellizzeri | For $n$ fencers, the worst case can never need more than $\binom{n}{2}=\frac12 \cdot n (n-1)$ fights, since that's the number of pairs of fencers. | |
| Jan 5, 2016 at 9:45 | history | edited | thepace | CC BY-SA 3.0 |
added 124 characters in body
|
| Jan 5, 2016 at 9:34 | history | answered | thepace | CC BY-SA 3.0 |