C++ How to Program, 10/e

Summary

Section 20.1 Introduction

• Searching data involves determining whether a search key (p. 842) is present in the data and, if so, returning its location.

• Sorting (p. 842) involves arranging data into order.

• One way to describe the efficiency of an algorithm is with Big O notation (p. 842), which indicates how much work an algorithm must do to solve a problem.

Section 20.2 Searching Algorithms

• A key difference among searching algorithms is the amount of effort they require to return a result.

Section 20.2.1 Linear Search

• The linear search (p. 843) compares each array element with a search key. Because the array is not in any particular order, it’s just as likely that the value will be found in the first element as the last. ...