Timeline for Selection algorithms (order statistic) in Java: linear time vs. sorting selector vs. Quickselect
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2022 at 15:35 | vote | accept | coderodde | ||
| Sep 29, 2022 at 7:51 | history | edited | greybeard | CC BY-SA 4.0 |
beyond code keyhole ...
|
| Sep 29, 2022 at 7:23 | history | edited | greybeard | CC BY-SA 4.0 |
meh
|
| Sep 29, 2022 at 7:18 | comment | added | greybeard | (I don't need to suggest another pivot selection for O(n) quickselect, PICK2 from the almost 50 year old paper looks a lot like my idea.) | |
| Sep 28, 2022 at 7:56 | comment | added | greybeard | 20 to 60 for 2nd, 40 to 80 for 4th median of five? 10 to 50 for 1st, 50 to 90 for last… | |
| Sep 28, 2022 at 7:14 | history | edited | greybeard | CC BY-SA 4.0 |
muse about median-of-five
|
| Sep 28, 2022 at 7:01 | history | answered | greybeard | CC BY-SA 4.0 |