Timeline for Benchmark a sorting method for fixed-size arrays
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2015 at 16:52 | vote | accept | Morwenn | ||
| Aug 7, 2015 at 8:44 | comment | added | Morwenn | Just doing that produces less cool (eh, it was deemed to happen) but more consistent results. And the results are more or less the less the same every time, so that's really consistent. Thanks again :) | |
| Aug 5, 2015 at 23:30 | comment | added | Emily L. |
@Morwenn If it is feasible and you want to reduce effects of cache warm-up on your tests, you could use std::vector<std::array<T, K>> to hold your shuffled arrays in contiguous memory.
|
|
| Aug 5, 2015 at 23:18 | history | edited | Emily L. | CC BY-SA 3.0 |
added 6 characters in body
|
| Aug 5, 2015 at 21:41 | history | answered | Emily L. | CC BY-SA 3.0 |