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

notes for the difference between MC and LV randomized algorithms

Browse Source
This commit is contained in:
Damian Gryski 2019-11-11 20:41:59 -05:00
parent 619bc1b4c5
commit a947b12be4
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
performance.md
View File

@ -626,7 +626,7 @@ TODO: notes on algorithm selection
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: MC vs. LV randomized algorithms: MC vs. LV: MC gamble with correctness, LV with time/termination
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