diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2021-06-02 21:25:36 -0400 |
|---|---|---|
| committer | Marshall Lochbaum <mwlochbaum@gmail.com> | 2021-06-02 21:25:36 -0400 |
| commit | 39c1bd1554d439477b788f53549a5d4362a768a9 (patch) | |
| tree | 6881f5e8d6e22b0ad937b0b1b4da1aef039b55e0 /implementation/primitive/README.md | |
| parent | f4ae29e3f08cf06a0490bd9863e7a614116e30ac (diff) | |
Notes on efficient Indices and Replicate
Diffstat (limited to 'implementation/primitive/README.md')
| -rw-r--r-- | implementation/primitive/README.md | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/implementation/primitive/README.md b/implementation/primitive/README.md index 6661563a..68bdcfca 100644 --- a/implementation/primitive/README.md +++ b/implementation/primitive/README.md @@ -4,6 +4,7 @@ Commentary on the best methods I know for implementing various primitives. Often there are many algorithms that are viable in different situations, and in these cases I try to discuss the tradeoffs. +- [Replicate](replicate.md) - [Sorting](sort.md) Raw speed is of course the most important factor; I also consider predictability and memory usage to be important. Predictability mostly for the benefit of the programmer, but it's also important when there are multiple algorithms to be able to compute which one will be fastest. In some cases an algorithm is best on some subset of inputs, but is effectively useless because it's too difficult to tell if the input falls in that set. Whitney and other K users sometimes profess that binary size is critically important; I don't believe this. |