azalea/CSC110
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[F] A4 P3.2 Grammar

Browse Source
This commit is contained in:
Hykilpikonna
2021-11-09 15:49:45 -05:00
parent 191e37908a
commit 475a22d148
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
assignments/a4/a4.tex
+1 -1
View File
@@ -272,7 +272,7 @@ Let $P$ be the size of the input set \code{primes}, and let $m$ be the product o
Let $c_0, \dots, c_n$ be constants that doesn't depend on any variables.
The inner loop \code{for p in primes} runs $P$ iterations, and since each iteration contains only a constant number of constant-time operations, taking $c_0P$ steps where $c_0$ is a constant. The outer loop iterates $m - 1$ times, taking $c_0P + c_1$ steps each time, with a total of $(m - 1)(c_0P + c_1)$ steps.
The inner loop \code{for p in primes} runs $P$ iterations, and since each iteration contains only a constant number of constant-time operations, it takes $c_0P$ steps where $c_0$ is a constant. The outer loop iterates $m - 1$ times, taking $c_0P + c_1$ steps each time, with a total of $(m - 1)(c_0P + c_1)$ steps.
Since there are only constant-time operations outside the outer loop, the entire function will take $(m - 1)(c_0P + c_1) + c_2$ steps.