Timeline for Find k max integers of an array -- Min Heap vs. Selection Algo vs. Selection Sort
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2024 at 2:27 | answer | added | J_H | timeline score: 2 | |
| Jul 12, 2024 at 10:56 | answer | added | gnasher729 | timeline score: 1 | |
| May 23, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Dec 25, 2016 at 17:27 | history | tweeted | twitter.com/StackSoftEng/status/813073678116253696 | ||
| Dec 23, 2016 at 0:08 | answer | added | user22815 | timeline score: 7 | |
| Dec 22, 2016 at 23:54 | comment | added | user188153 |
The first has O(n^2), second O(n log 1000), third O(n*1000). So what is the min of those with a given n?
|
|
| Dec 22, 2016 at 23:39 | history | edited | user22815 | CC BY-SA 3.0 |
Rewrote for better clarity.
|
| Dec 22, 2016 at 22:49 | comment | added | user3795202 | @snowman I'm trying to figure out which one of the three algorithms I mentioned is best and why? | |
| Dec 22, 2016 at 22:15 | review | Close votes | |||
| Dec 23, 2016 at 0:11 | |||||
| Dec 22, 2016 at 21:59 | comment | added | user22815 | Are you looking for an algorithm? Information on a min heap? While I understand what you are trying to do, I am not quite sure which aspect of the task you need help with. | |
| Dec 22, 2016 at 21:55 | review | First posts | |||
| Dec 23, 2016 at 8:12 | |||||
| Dec 22, 2016 at 21:53 | history | asked | user3795202 | CC BY-SA 3.0 |