aboutsummaryrefslogtreecommitdiff
path: root/thesis/parts/results.tex
diff options
context:
space:
mode:
Diffstat (limited to 'thesis/parts/results.tex')
-rw-r--r--thesis/parts/results.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/thesis/parts/results.tex b/thesis/parts/results.tex
index 6562d38..944ecd8 100644
--- a/thesis/parts/results.tex
+++ b/thesis/parts/results.tex
@@ -116,8 +116,8 @@ As the spread of points also appears to increase at larger $n$ values, its possi
\code{HashSet} appears roughly linear as expected, with only a slow logarithmic rise, probably due to an increasing amount of collisions.
\code{BTreeSet} is consistently above it, with a slightly higher logarithmic rise.
-\code{BTreeMap} and \code{HashMap} both mimic their set counterparts, but with a slightly lower overall cost this time.
-\todo{It's unclear why this is.}
+\code{BTreeMap} and \code{HashMap} both mimic their set counterparts, but with a slightly lower cost and growth rate.
+It's unclear why this is, however it could be related to the larger spread in observations for both implementations.
\subsection{Evaluation}