Estimate the running time for the following program fragment in terms of n. Assu

Question

Estimate the running time for the following program fragment in terms of n. Assume that the value of n is determined elsewhere in the program. Make your upper bound and lower bound as tight as you can. Please answer the following: 1. State an upper bound on the running time of the program fragment using O( notation. 2. Briefly justify your upper bound. State a lower bound on the running time of the program fragment using notation. 3. 4. Briefly justify your lower bound. Even in cases where the upper bound and lower bound are the same function, the justifications would be different. (For upper bounds, you are claiming that the code will run no slower than the upper bound. For lower bounds, you are claiming that the code will take at least that amount of time.) Question 1: while Lt1

Explanation / Answer

The code will have same Upper bound and Lower bound

The 1st loop runs n times from 0 to n-1

And t after 1st loop is n+1

And the second loop runs log2n times

So Time Complexity = O(n+log n)

= O(n)

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

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