lacau/Projet_Boites
2
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

tex: detail stat analysis complexity

Browse source
This commit is contained in:
Paul ALNET 2023-06-04 11:02:26 +02:00
parent 064eeabad5
commit ac6c443beb
1 changed files with 4 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
latex/content.tex
View file

@ -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}