NVAEducation

NVAEducation

Question No.1832

Determine the complexity of an algorithm that measures the-01832

Online Quiz This subjective question is related to the book/course vu mgt101 Financial Accounting. It can also be found in vu mgt101 Mid Term Solved Past Paper No. 2.

Question 1: Determine the complexity of an algorithm that measures the number of print statements in an algorithm that takes a positive integer n and prints 1 one time, 2 two times, 3 three times , ... , n n times.
That is
1
2 2
3 3 3
...
n n n n ... n (n times)
Note:There is no need to write Algorithm(Pseudo code)
Answer:
Be the first to post an answer to earn 100 credits.

Choose an organization

Virtual University

Virtual University
Gegasoft

Gegasoft
Theme Customizer

Gaussian Texture

Gradient Background