Timeline for Tell me how to flop
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2018 at 9:38 | comment | added | Neil | @PeterTaylor I don't think the answer actually performs flops, rather, it removes the largest element each time, and outputs the equivalent of that operation in terms of flops. | |
| Jan 31, 2018 at 8:27 | comment | added | Peter Taylor | You can move the largest element to the end with just i, n. Why then do n-1, i-1? There's no need for a stable sort. | |
| Jan 31, 2018 at 3:38 | history | answered | Misha Lavrov | CC BY-SA 3.0 |