Timeline for Find median of unsorted array in $O(n)$ time
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31 at 10:09 | review | Close votes | |||
| Feb 5 at 3:02 | |||||
| Jan 31 at 9:44 | comment | added | codeR | Does this answer your question? Computational complexity of calculating mean vs median? | |
| Jan 31 at 9:42 | comment | added | codeR | One can make a heap in O(n) time (check any good book or the internet for the build_heap method). Secondly, this is a very standard and well-known problem that can be found in any standard algorithm book or by simply doing a quick search on the internet, as pointed out by others. | |
| Feb 1, 2020 at 12:27 | answer | added | gnasher729 | timeline score: 8 | |
| Feb 1, 2020 at 5:56 | answer | added | Sejpalsinh Jadeja | timeline score: 1 | |
| Feb 15, 2018 at 16:26 | answer | added | zdm | timeline score: 11 | |
| S Feb 14, 2018 at 14:32 | history | suggested | siegi | CC BY-SA 3.0 |
Better title, fix typo, formulation
|
| Feb 14, 2018 at 6:07 | review | Suggested edits | |||
| S Feb 14, 2018 at 14:32 | |||||
| May 18, 2016 at 4:30 | history | tweeted | twitter.com/StackCompSci/status/732790398897250306 | ||
| Aug 4, 2015 at 20:51 | comment | added | Evgeny Zislis | stackoverflow.com/questions/2571358/median-of-a-billion-numbers | |
| May 20, 2012 at 2:02 | vote | accept | Luv | ||
| May 20, 2012 at 0:23 | answer | added | jmad | timeline score: 75 | |
| May 19, 2012 at 10:30 | comment | added | Raphael | Note the related meta discussion; as it turns out, simple web searches lead to the answer to this question. | |
| May 18, 2012 at 17:53 | history | edited | Kaveh | CC BY-SA 3.0 |
added 13 characters in body; edited tags
|
| May 18, 2012 at 17:40 | history | asked | Luv | CC BY-SA 3.0 |