Topics discussed in this section: 8-6 Searching Another common operation in computer science is searching, which is the process used to find the location of a target among a list of objects. In the case of an array, searching means that given a value, we want to find the location (index) of the first element in the array that contains that value. Topics discussed in this section: Sequential Search Binary Search Computer Science: A Structured Programming Approach Using C

FIGURE 8-27 Search Concept Computer Science: A Structured Programming Approach Using C

FIGURE 8-28 Locating Data in Unordered List Computer Science: A Structured Programming Approach Using C

FIGURE 8-29 Unsuccessful Search in Unordered List Computer Science: A Structured Programming Approach Using C

PROGRAM 8-13 Sequential Search Computer Science: A Structured Programming Approach Using C

PROGRAM 8-13 Sequential Search Computer Science: A Structured Programming Approach Using C

FIGURE 8-31 Binary Search Example Computer Science: A Structured Programming Approach Using C

FIGURE 8-32 Unsuccessful Binary Search Example Computer Science: A Structured Programming Approach Using C

PROGRAM 8-14 Binary Search Computer Science: A Structured Programming Approach Using C

PROGRAM 8-14 Binary Search Computer Science: A Structured Programming Approach Using C