summaryrefslogtreecommitdiffstats
path: root/chapters/dynamization.tex
diff options
context:
space:
mode:
authorDouglas Rumbaugh <dbr4@psu.edu>2025-06-27 15:21:38 -0400
committerDouglas Rumbaugh <dbr4@psu.edu>2025-06-27 15:21:38 -0400
commitfcdbcbcd45dc567792429bb314df53b42ed9f22e (patch)
tree3f7c135b7b32022fa0a9f03361e60cc0cc4f86e0 /chapters/dynamization.tex
parentff528e8595e82802832930fae6c9ccee7afd23cb (diff)
downloaddissertation-fcdbcbcd45dc567792429bb314df53b42ed9f22e.tar.gz
updates
Diffstat (limited to 'chapters/dynamization.tex')
-rw-r--r--chapters/dynamization.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex
index 1e0d3e2..085ce65 100644
--- a/chapters/dynamization.tex
+++ b/chapters/dynamization.tex
@@ -1499,7 +1499,7 @@ but it has a number of serious problems,
is not always possible to do this efficiently, particularly for
structures whose construction involve multiple stages (e.g.,
a sorting phase followed by a recursive node construction phase,
- like in a B+Tree) with non-trivially predictable operation counts.
+ like in a B+tree) with non-trivially predictable operation counts.
\item Even if the reconstruction process can be efficiently
sub-divided, implementing the technique requires \emph{significant}