For the following part of an algorithm: for k: = 1 to n For m: = 1 to k x: = 9.

Question

For the following part of an algorithm: for k: = 1 to n For m: = 1 to k x: = 9. K - 7. M/ 4 Next m Next k
A) how many operations for the inner loop when te algorithm segment is excited ? How many operations for the entire algorithm when it is executed? B) what is the order of this algorithm?
For the following part of an algorithm: 4. for k : = 1 to n for m : = 1 to k next m next k a. How many operations for the inner loop when the algorithm segment is ekecued? How many operations for the entire algorithm when it is executed? What is the order for this algorithm? b. Answer: (Show the steps for your answer)

Explanation / Answer

a). For inner loop it will be having k number of operations as it is iterating in the range of k value.

b). Order of the total algorithm is O(n^2) as there are 2 loops in the algorithm which will iterate twice themselves.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.