add note about sorting

2018-03-12 08:44:25 -07:00 · 2018-03-12 08:44:25 -07:00 · c8ad697848
commit c8ad697848
parent c6692519cc
1 changed files with 2 additions and 0 deletions
--- a/performance.md
+++ b/performance.md
@ -878,6 +878,8 @@ Techniques specific to the architecture running the code
    counts[i & 1] ++
    "branch-free code", benchmark; not always faster, but frequently harder to read

+* sorting data can help improve performance via both cache locality and branch prediction, even taking into account the time it takes to sort
+   * use a specialized sort, such as radix sort, if possible
 * function call overhead
 * reduce data copies