Give a big-O estimate for the number of operations (where an operation is an addition or a

Question:

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.
t := 0
for i := 1 to 3
for j := 1 to 4
t := t + ij
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: