From ac6c443beb7c90e673fda0dc0b05b311846f9c67 Mon Sep 17 00:00:00 2001
From: Paul ALNET <paul@shimaore.net>
Date: Sun, 4 Jun 2023 11:02:26 +0200
Subject: [PATCH] tex: detail stat analysis complexity

---
 latex/content.tex | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/latex/content.tex b/latex/content.tex
index d6664d1..5aa5bde 100644
--- a/latex/content.tex
+++ b/latex/content.tex
@@ -241,8 +241,10 @@ $ f_{U_{k-1}}(y) = 1 $.
 
 \section{Complexity and implementation optimization}
 
-The NFBP algorithm has a linear complexity $ O(n) $, as we only need to iterate
-over the items once.
+Both the NFBP and NFDBP algorithms have a linear complexity $ O(n) $, as we
+only need to iterate over the items once. While the algorithms themselves are
+linear, calculating the statistics may not not be. In this section, we will
+discuss how to optimize the implementation of the statistical analysis.
 
 \subsection{Performance optimization}