# Algorithm for printing @ symbols

While *n* is less than or equal to 10:

print *n* @ symbols

go to next line*n = n* + 1

a.

i.Show what is displayed as a result of this algorithm when *n* has an initial value of 4.

ii.How many @ symbols are printed in total when *n* has an initial value of 4?

b.Write down an expression that gives the total number of @ symbols that are printed by this algorithm for any value of *n*. Hint: consider the number of @ symbols if *n* = 1, and then subtract the number of @ symbols that are missing if *n* > 1

c.If printing an @ symbol is considered to be a step, write down the Big O notation for this algorithm. Explain your answer.

Cikluzzz

13

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

Alessandro Iraci

1.7K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.

- answered
- 431 views
- $5.89

### Related Questions

- Five times the larger of two consecutive odd integers is equal to one more than eight times the smaller. Find the integers.
- Graph Equation from Test
- Does $\lim_{n \rightarrow \infty} \frac{2^{n^2}}{n!}$ exist?
- I really can't figure out equations with a power of 2 in it, please solve these and explain every step as if I was a baby.
- How to properly write rational exponents when expressed as roots?
- A word problem about a rectangular carpet
- How do you go about solving this question?
- Fields and Galois theory

I think c. is ambiguous. I would say it's O(1), since the number of @ symbols you can print is bounded, but I can see the argument for O(n^2).

Awesome, really appreciate your help Alessandro, hope you have a great new year!