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

mention monte carlo and las vegas randomization

Browse Source
This commit is contained in:
Damian Gryski 2018-11-26 13:08:58 -08:00
parent 0da2084559
commit 085c11002a
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
performance.md
View File

@ -549,14 +549,13 @@ than more esoteric or exotic and complex ones.
TODO: TODO:
improve worst-case behaviour at slight cost to average runtime improve worst-case behaviour at slight cost to average runtime
linear-time regexp matching linear-time regexp matching
randomized algorithms randomized algorithms: MC vs. LV
improve worse-case running time improve worse-case running time
skip-list, treap, randomized marking, skip-list, treap, randomized marking,
primality testing, randomized pivot for quicksort primality testing, randomized pivot for quicksort
power of two random choices power of two random choices
statistical approximations (frequently depend on sample size and not population size) statistical approximations (frequently depend on sample size and not population size)
TODO: batching to reduce overhead: https://lemire.me/blog/2018/04/17/iterating-in-batches-over-data-structures-can-be-much-faster/ TODO: batching to reduce overhead: https://lemire.me/blog/2018/04/17/iterating-in-batches-over-data-structures-can-be-much-faster/
### Benchmark Inputs ### Benchmark Inputs