Chapter 16 Outcomes
Seeking Better Solutions

After completing this chapter and participating in class, you should be able to accomplish each of the following outcomes.

Knowledge Outcomes

  1. Define each of the key terms listed in the chart below.

    2. linear search binary search search space
    efficiency of method insertion sort  

  2. Explain the circumstances under which it would be worth your time to research and/or develop highly efficient algorithms for a given problem.

  3. Describe the difference between a linear search and a binary search. Explain how much more efficient a binary search is than a linear search.

  4. Discuss the trade-off that must be made to be able to use a binary search algorithm.

  5. Describe the main difference between a less-efficient sort algorithm and a more-efficient sort algorithm.

  6. Explain the difference between the less efficient method of sorting by selection, and the more efficient method of sorting by selection.

Skills Outcomes

  1. Use tracing techniques to explain how the binary search procedure performs its tasks.

  2. Use tracing techniques to explain how the selection sort procedure performs its tasks.

  3. Use the computer to time the difference between less-efficient sorting algorithms and more-efficient sorting algorithms.