Mazdak Farrokhzad edited analysis setup.tex  about 10 years ago

Commit id: e731ae95e1cbb9c8964f14ca59483401420698ca

deletions | additions      

       

\end{verbatim}  First things first, regarding line \#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} $\mathcal{O}$  complexity.