deletions | additions       diff --git a/analysis setup.tex b/analysis setup.tex  index 91d17fc..5276ad0 100644  --- a/analysis setup.tex  +++ b/analysis setup.tex 
...
#8 end loop  \end{verbatim}  First things first, regarding \#1 - we couldn't decide whether the array is an in-parameter and if the algorithm in that case begins by setting all elements in the array to true - in which case $n$ would have to be added to $T(n)$ In the section "Solving the sum" we haven't added it, but it would be trivial to do so, and it wouldn't change the \mathcal{O} complexity.