# 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
- 507 views
- $5.89

### Related Questions

- How does the change in $b$ in the quadratic formula $ax^2+bx+c$ move the parabola in an inverted version of the quadratic function?
- Linearly independent vector subsets.
- When is Galois extension over intersection of subfields finite
- MAT-144 Assignment
- Finding values of k for different points of intersection
- Find $x$, if $\sqrt{x} + 2y^2 = 15$ and $\sqrt{4x} − 4y^2 = 6$.
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- Is the $\mathbb{C}$-algebra $Fun(X,\mathbb{C})$ semi-simple?

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!