JAVA Study Questions on the Introduction to Algorithm Complexity 7) What is the

Question

JAVA Study Questions on the Introduction to Algorithm Complexity

7) What is the order of complexity for the algorthm to push an item on a stack?

8) What is the order of complexity to enqueue an item on a queue?

9) What is the order of complexity to find a data item in a list? (Unordered and Ordered) 10) Is it feasible to develop and implement an algorithm of order 2n?        If an algorithm is of the order 2n   much many more times does it take for the algorithm to run with an input size of 10 vs an input size of 5?

Explanation / Answer

7. To push an item on a stack the complexity is O(1).

8. To enqueue an item on a queue the complexity is O(1).

9. For finding data item in a list it will take O(n) time complexity.

If an algorithm designed with order 2n for the input size 10 it will take 2*10 times, for the input size of 5 it will take 2*5 times.

In perspective to List, developing an algorithm of order 2n is not feasible.

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

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