[O] A4 P3.1 Reword
This commit is contained in:
@@ -263,8 +263,10 @@ The loop in the function runs until $N[-2] + 6 < n$. Since $N = \text{list}[1, 5
|
||||
|
||||
Since the loop contained only constant-time operations, the runtime of the loop is $\cO(n)$.
|
||||
|
||||
\item[2.]
|
||||
TODO: Running-time analysis of \texttt{starting\_coprime\_numbers}.
|
||||
Since there are only constant-time operations outside the loop, the runtime of the entire function is $\cO(n)$.
|
||||
|
||||
\item[2.]
|
||||
Running-time analysis of \texttt{starting\_coprime\_numbers}.
|
||||
|
||||
\item[3.]
|
||||
TODO: Running-time analysis of \texttt{coprime\_to\_all}.
|
||||
|
||||
Reference in New Issue
Block a user