Timeline for answer to Why is quicksort better than mergesort? by Winter Melon
Current License: CC BY-SA 3.0
Post Revisions
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 3, 2018 at 12:26 | comment | added | Jim Balter | This is complete nonsense. quicksort is used because of its performance, not "philosophy" ... and the claims about "order is bound to be lost" is simply false. | |
| Jan 1, 2018 at 22:05 | comment | added | Winter Melon | quicksort benefits from randomness of pivot selection. The random pivot would naturally tend toward 50:50 partition and is unlikely to be consistently towards one of the extremes. The constant factor of nlogn is fairly low till average partitioning is 60-40 or even till 70-30. | |
| Dec 10, 2017 at 23:21 | history | edited | Winter Melon | CC BY-SA 3.0 |
added 190 characters in body
|
| Dec 10, 2017 at 23:17 | review | Late answers | |||
| Dec 10, 2017 at 23:20 | |||||
| Dec 10, 2017 at 23:09 | history | edited | Winter Melon | CC BY-SA 3.0 |
added 171 characters in body
|
| Dec 10, 2017 at 22:57 | history | answered | Winter Melon | CC BY-SA 3.0 |