Timeline for What is a the fastest sorting algorithm for an array of integers?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 8, 2017 at 16:30 | comment | added | Kashyap | @Evil Yes. Quicksort isn't well suited for parallel processing. It's an example. The ones that should be used are listed in links given. | |
| Dec 8, 2017 at 12:24 | comment | added | Evil | Quicksort is not really well suited for parallel processing in the standard form, which means that either any bitonic sorter should be better on average or the Quicksort is modified (more than intro sort, where merge phase is dominant) or the several split phases are done in host environment, which is counterproductive for parallelisation. In theory Quicksort is in fact $\mathcal O(n^2)$. | |
| Dec 8, 2017 at 6:23 | history | edited | Kashyap | CC BY-SA 3.0 |
added 28 characters in body
|
| Dec 8, 2017 at 1:36 | review | First posts | |||
| Dec 8, 2017 at 12:24 | |||||
| Dec 8, 2017 at 1:32 | history | answered | Kashyap | CC BY-SA 3.0 |