Mazdak Farrokhzad edited stuff.tex  about 10 years ago

Commit id: 07927f3f1815637af0501bbd9a7bb1e0e96fdd2f

deletions | additions      

       

\section{The algorithm}  The algorithm is as follows:  \begin{verbatim} prime: array [1..n] of boolean = all true for p in 2..sqrt(n) loop  if prime[p] then  m = p*p