Timeline for Median Calculation of List of Integers without using heap
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | Community Bot |
Commonmark migration
|
|
| Aug 15, 2018 at 16:47 | vote | accept | danieltakeshi | ||
| Aug 15, 2018 at 14:20 | comment | added | Toby Speight | Yes, use Python's built-in sort for a one-time sorting of a list - see edit. | |
| Aug 15, 2018 at 14:19 | history | edited | Toby Speight | CC BY-SA 4.0 |
Use built-in sort for speed
|
| Aug 15, 2018 at 13:52 | comment | added | danieltakeshi |
You are right on the General Review, yield is only necessary for the running median, so i changed to return and the result to result = Median(data). Else was used instead of elif. Is there any algorithm that generates the list on an improved way, faster?
|
|
| Aug 15, 2018 at 13:39 | history | answered | Toby Speight | CC BY-SA 4.0 |