Timeline for Why is processing a sorted array faster than processing an unsorted array?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2021 at 22:29 | comment | added | Peter Cordes | This seems to be missing the point of the question, and is answering whether sorting itself is faster with already-sorted arrays. This is less surprising because as this answer points out, there's less work to be done (with most sort algorithms other than merge-sort), on top of the branch-prediction effect. The actual question factors out this effect and is only timing a conditional increment. | |
| Jan 10, 2021 at 16:02 | history | edited | Deduplicator | CC BY-SA 4.0 |
copy-edited
|
| S Oct 14, 2019 at 23:34 | history | answered | Selcuk | CC BY-SA 4.0 | |
| S Oct 14, 2019 at 23:34 | history | made wiki | Post Made Community Wiki by Selcuk |