Question

11. To answer this question, consider the n, consider the following algorithm: for (int i-0; i<ni i++) for (int j = 0; j <= i; j++) // three assignment statements in body of this inner loop a. (6 pts) Exactly how many assignments (in terms of n) are made in this algorithm?

b. what is the order (big -o) of this algorithm?

Answer 1

First for loop is running for i values from 0 to n-1 with an increment of 1


Second for loop is running for j values from 0 to i with an increment of 1

Number of assignments

= $\sum_{i=0}^{n}\sum_{j = 0}^{i}1$

$=1+2+3+..+n$

$=\frac{n(n+1)}{2}$

$\color{red}Note: \;Please \;comment \;below \;if \;you \;have \;any \;doubts$

$\color{blue}Please\; up\;vote\;the \;solution \;if \;it \;helped.\;Thanks!$