Timeline for Why is processing a sorted array faster than processing an unsorted array?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 18, 2022 at 5:43 | history | edited | Günter Zöchbauer | CC BY-SA 4.0 |
edited body
|
| Nov 6, 2021 at 0:11 | history | undeleted | Geek26 | ||
| Nov 6, 2021 at 0:10 | history | edited | Geek26 | CC BY-SA 4.0 |
added 87 characters in body
|
| Nov 5, 2021 at 22:44 | history | deleted | Geek26 | via Vote | |
| Nov 5, 2021 at 10:50 | comment | added | Peter Cordes | The should be a change near the middle of the sorted train-track / path of execution, as the branch inside the loop is taken for the first ~half, not-taken for the last ~half of the elements. (Or vice versa.) Also, what do the 5 different levels in the unsorted case mean? It's a 2-way branch. | |
| Nov 5, 2021 at 10:05 | history | answered | Geek26 | CC BY-SA 4.0 |