# 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 be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

Alessandro Iraci

1.6K

The answer is accepted.

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

- answered
- 326 views
- $5.89

### Related Questions

- Let $f(x,y,z)=(x^2\cos (yz), \sin (x^2y)-x, e^{y \sin z})$. Compute the derivative matrix $Df$.
- Prove that: |x| + |y| ≤ |x + y| + |x − y|.
- Evaluate $\int_0^{\frac{\pi}{2}}\frac{\sqrt{\sin x}}{\sqrt{\sin x}+\sqrt{\cos x}} dx$
- Need to figure distance between two points/lines.
- Please help me with this math question
- Prove that $tan x +cot x=sec x csc x$
- Fields and Galois theory
- Algebra Word Problem #2

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!