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

solving the more general problem might be better for algorithms

Browse Source
This commit is contained in:
Damian Gryski 2018-03-14 17:41:44 -07:00
parent a52d4b84a2
commit db4da56c32
1 changed files with 6 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
performance.md
View File

@ -509,6 +509,12 @@ This also applies to subproblems your algorithm needs to solve. For example,
being able to use radix sort can have a significant impact on performance, or
using quickselect if you only need a partial sort.
Sometimes rather than specialization for your particular task, the best
approach is to abstract it into a more general problem space that has been
well-studied by researchers. Then you can apply the more general solution to
your specific problem. Mapping your problem into a domain that already has
well-researched implementations can be a significant win.
### Benchmark Inputs
Know how big each of your input sizes is likely to be in production.