Timeline for Why is processing a sorted array faster than processing an unsorted array?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2021 at 15:50 | history | edited | Deduplicator | CC BY-SA 4.0 |
copy-edited
|
| S Nov 7, 2020 at 9:35 | history | suggested | Aryan | CC BY-SA 4.0 |
Sorted link in the title of post for better understanding
|
| Nov 7, 2020 at 7:11 | review | Suggested edits | |||
| S Nov 7, 2020 at 9:35 | |||||
| Mar 16, 2018 at 15:37 | comment | added | ForeverLearning |
@PeterMortensen I am a bit flummoxed by your question. For example here is one relevant line from that piece: When the input is unsorted, all the rest of the loop takes substantial time. But with sorted input, the processor is somehow able to spend not just less time in the body of the loop, meaning the buckets at offsets 0x18 and 0x1C, but vanishingly little time on the mechanism of looping. Author is trying to discuss profiling in the context of code posted here and in the process trying to explain why the sorted case is so much more faster.
|
|
| Mar 16, 2018 at 12:51 | review | Low quality answers | |||
| Mar 16, 2018 at 13:53 | |||||
| Mar 16, 2018 at 12:47 | comment | added | Peter Mortensen | That is a very interesting article (in fact, I have just read all of it), but how does it answer the question? | |
| Jan 17, 2017 at 18:02 | history | edited | ForeverLearning | CC BY-SA 3.0 |
grammar
|
| Jan 12, 2017 at 1:50 | history | answered | ForeverLearning | CC BY-SA 3.0 |