CS3401 Practice Quiz 2 Part 3
Introduction to Java Programming Introduction to Java Programming, Ninth Edition, Y. Daniel Liang Chapter 24 Developing Efficient Algorithms Please send suggestions and errata to Dr. Liang at y.daniel.liang@gmail.com . Indicate which book and edition you are using. Thanks! Section 24.2 Measuring Algorithm Efficiency Using Big O Notation 24.1 Estimating algorithm efficiency is ________ A. to measure their actual execution time. B. to estimate their execution time. C. to estimate their growth function. Your answer is correct 24.2 An input that results in the shortest execution time is called the _____________. A. best-case input B. worst-case input C. average-case input Your answer is correct 24.3 Why is the analysis often for the worst case? A. Best-case is not representative. B. Worst-case is not representative, but worst-case analysis is very useful. You can show that the algo...