Time Complexity - Practice Questions draw the table with these columns: iteratio

Question

Time Complexity - Practice Questions draw the table with these columns: iteration, value of i, values of k, iterations count for k, values of t, iteration count for t, total repetitions due to k fork and for t loops for one i write the summation, write the closed form solution where required. (Note that the 3 summations in the cheat sheet - are provided with their closed form. E.g. for 1+2+3+.(n)+n also written as t, has ! closed form: "(n+1) dominant term (if you could find a closed form for the summation) write (Theta) (if you can) a) Closed form, dominant term and NOT required. 01. a) for (1-1; 1

Explanation / Answer

Here si the solution, do give me a thumbs up if this helps!

loop with t : since it grows exponentially t=2*t till it becomes N, its complexity is O(log(N)

loop with i : it linearly moves from 1 to N, time complexity O(N)

loop with k : since it grown exponentially till it becomes i in every iteration, time complexity O(log(N))

Thus, time complexity is O(N*(logN)^2)

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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