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

Another typo in math mode

Browse source
This commit is contained in:
Ariel 2023-12-18 21:26:06 +01:00
parent 7e69d4949e
commit 6e9c1b0a22
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

@ -23,7 +23,7 @@ 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)$ 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 comparisons for lookup. While for skip lists the performance
characteristics are about as good as that of randomly-built binary characteristics are about as good as that of randomly-built binary
search trees - namely ($\mathcal{O}(\log n)$). So the choice of which to select search trees - namely $\mathcal{O}(\log n)$. So the choice of which to select
depends very much on memory available, insert/read characteristics, depends very much on memory available, insert/read characteristics,
etc. So delegating the choice to a single point in your code is a very etc. So delegating the choice to a single point in your code is a very
good idea. Unfortunately, in Erlang that's so easy to do at the moment. good idea. Unfortunately, in Erlang that's so easy to do at the moment.