2. Does a faster computer make a better algorithm? e.g. How long would it take,

Question

2. Does a faster computer make a better algorithm? e.g. How long would it take, if I can try 10000 edges per second, to brute-force a solution to minimum spanning tree? What if tomorrow they released a computer than ran twice as fast (they won't) that could examine 20000 edges per second? Assume we have 100 vertices, and E E(V2). 3, Input size: what does "N” represent? What does O(1) mean? 5. Put these functions in order of efficiency: O(VN),(N), O(N3), O(V E), O(N Ig N), 6. About how many times can we divide a number n in half before n . What are efficiency and correctness as applied to an algorithm? 1? How many times can we divide it by 4 until n 1 (Give an expression.)

Explanation / Answer

1.Computational efficiency is the properties of an algorithm or a process which relates to a number of computational resources being used for solving that particular algorithm.

The word efficient has much contradicting meaning in the genereal term, but in the field of computer science, scientists have made it very precise in the way computational efficiency is used/understood. The general way of talking about computational efficiency is about minimizing how much of resources are used in order to complete a task. The resources to minimize vary from problem to problem or task to task, but the very most important one is often time. And, computational time is often calculated in terms of steps. Thus, "Computational efficiency" is about finding the way to solve a problem/ algorithm in the minimum possible steps.

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

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