Algorithms/go-perfbook
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add note about sorting

Browse Source
This commit is contained in:
Damian Gryski 2018-03-12 08:44:25 -07:00
parent c6692519cc
commit c8ad697848
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
performance.md
View File

@ -878,6 +878,8 @@ Techniques specific to the architecture running the code
counts[i & 1] ++ counts[i & 1] ++
"branch-free code", benchmark; not always faster, but frequently harder to read "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 * function call overhead
* reduce data copies * reduce data copies