Give a big-O estimate for the number of additions ued in the segment of an algorithm...

Question

Question

Give a big-O estimate for the number of additions ued in the segment of an algorithm below.

t:=0

for i := 1 to n

for j := 1 to n

t := t + i + j

engineering Computer-Science

Answer 1

Answer #1

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

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

= $n * \sum_{i = 1}^{n} 1$

= n * n

= n² $\in$ O(n²)

Answer 2

Similar Homework Help Questions

Discrete Math Give a big-Theta estimate for the number of additions in the following algorithm a)...

Discrete Math Give a big-Theta estimate for the number of additions in the following algorithm a) procedure f (n: integer) bar = 0; for i = 1 to n^3 for j = 1 to n^2 bar = bar + i + j return bar b) Consider the procedure T given below. procedure T (n: positive integer) if n = 1 return 2 for i = 1 to n^3 x = x + x + x return T(/4) + T(/4) +...
consider this segment of an algorithm: for i := 1 ton n for j:=1 to n...

consider this segment of an algorithm: for i := 1 ton n for j:=1 to n top:=ij+j+10 a. find a function f(n) that counts the number of multiplication and additions performed in this segment. b. Give a big O estimate for the number of additions and multiplications used in the segment
1, Variation on 3.3#4] Give a big-O estimate in terms of n for the number of...

1, Variation on 3.3#4] Give a big-O estimate in terms of n for the number of oper- ations used in this segment of an algorithm, where an operation is an addition or a multiplication, (ignoring comparisons used to test the conditions in the while loop). while i 〈 n j:= j + i [10 points]

Problem 7. Give a big-O estimate for the number of operations where an operation is an...

Problem 7. Give a big-O estimate for the number of operations where an operation is an addition or a multiplication, used in this segment of an algorithm (ignoring comparisons used to test the conditions in the vhile loop. while i Sn do end while
I need help with my discrete math problem. can you show me step by step process...

I need help with my discrete math problem. can you show me step by step process . Thanks in advance 3. Give a big-O estimate and a pair of witnesses for the number additions used in this segment of an algorithm. t:= 0 for i:=1 ton for j := 1 to n-i t:=t+i+j
. Big O Notation.Thanks to Reges, Building Java Programs, 2nd edition. Estimate the big-O complexity for...

. Big O Notation.Thanks to Reges, Building Java Programs, 2nd edition. Estimate the big-O complexity for each of these algorithms, and justify your answer. To confirm your calculations, answers are provided at the end of the rubric. Your justification can be mathematical or written, formal or informal. Rubric: Correct Big-O classification of four problems Justification of four problems Big-O categories: 3.1. O(log n). 3.2. O(n). 3.3. O(n2). 3.4. O(1) Problem Code fragment 3.1 int sum = 0; int j =...

b. what is the order (big -o) of this algorithm? 11. To answer this question, consider...

b. what is the order (big -o) of this algorithm? 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?
For the following program fragment give a Big-O analysis of the running time. Briefly explain your...

For the following program fragment give a Big-O analysis of the running time. Briefly explain your answer: int t = 0; for(int i=1; i <= n; i++) for(int j=1; j <= i*i; j++) if(j % i == 0) t++; What I have so far, O(1) + O(n) + O(n2) + O(1) + O(1) Drop Low order terms: O(n) + O(n2) And I believe the final answer to be O(n3), but not sure if just drop the O(n) or...
Find Big-O notation for the following algorithm: int function9(int n) { int ij for (i-0; in;...

Find Big-O notation for the following algorithm: int function9(int n) { int ij for (i-0; in; i++) for (0; j<n; j++ if (j1) break return j; } int function9(int n) { int ij for (i-0; in; i++) for (0; j

) Consider the following algorithm procedure polynomial (c, a0,a1, …, an) power :=1 y≔a0...

) Consider the following algorithm procedure polynomial (c, a0,a1, …, an) power :=1 y≔a0 for i=1 to n power≔power*c y≔y+ai*power return y Find a big-O estimate for the number of additions and multiplications used by this algorithm.