Chapter 9, Problem 7PE

Program Plan Intro

Search Benchmarks

Program Plan:

• Include the required header files.
• Declare the necessary function prototype and constants.
• Define the main () function.
  • Declare the necessary variables.
  • Declare and define the array values.
  • Get the number that is to be searched from the user.
  • Call the function “searchlinear()” to perform linear search and count the number of comparisons made during  the search.
  • Display the number of comparison made by the linear search.
  • Call the function “searchbinary()” to perform binary search and count the number of comparisons made during  the search.
  • Display the number of comparison made by the binary search.
• Define the “searchlinear()” method,
  • Declare the necessary variables
  • Use a loop that iterates for the elements that is present in the array.
  • A counter variable that gets incremented is used inside the loop to count the number of comparison made to find the target element.
  • A condition statement is used to compare the values of the array and the search element.
  • Return the count of the comparisons made.
• Define the “searchbinary()” method,
  • Declare the necessary variables.
  • A loop that iterates to search the elements those are present in the array.
  • A counter variable that gets incremented to count the number of comparison that is being made.
  • A condition statement that validates the position of the search element in the array.
  • Based on the position of the array the search is performed with the count of the comparison that is made.
  • Return the count of the comparison made.