Two algorithms, called A1 and A2, have been proposed for processing data in an E

Question

Two algorithms, called A1 and A2, have been proposed for processing data in an Electronic Medical Record. Applying your excellent algorithm analysis skills you compute that the time complexity of A1 is O(3n) while that of A2 is O(3^n). Here 3^n stands for 3 raised to the nth power. Recall also that time complexity is a measure of the speed of an algorithm. Which one of the following is correct. a. Algorithm speeds cannot be compared using this information b. A1 is faster than A2 c. The two algorithms have equal speed. d. A1 is slower than A2

Explanation / Answer

We can predict which algorithm is better by 2 ways :: 1) Time Complexity 2) Space Complexity Since in the question you have asked for the faster algorithm based on the given time complexities .. it is clear that the algo with lesser time complexity would be faster. now A1 has O(n) and A2 has O(3^n) that means that both algorithms has an upper bound namely : A1 has O(n) A2 has O(3^n) i.e. A1 algorithms would take steps

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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