umgeher/erlware_commons
0
Fork 0
Code Issues Pull requests Releases Activity

Typo in math mode

Browse source
This commit is contained in:
Ariel 2023-12-18 21:00:25 +01:00
parent cd88825861
commit 68e9bbcd0f
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
doc/signatures.md
View file

@ -19,7 +19,7 @@ implement a dictionary. Just a few are:
Each of these approaches has their own performance characteristics,
memory footprints, etc. For example, a table of size $n$ with open
addressing has no collisions and holds up to $n$ elements, with a single
comparison for successful lookup, and a table of size $n$_ with chaining
comparison for successful lookup, and a table of size $n$ with chaining
and $k$ keys has the minimum $\max(0, k-n)$ collisions and $\mathcal{O}(1 + k/n)$
comparisons for lookup. While for skip lists the performance
characteristics are about as good as that of randomly-built binary