Chapter 17, Problem 3P

Program Plan Intro

Recursive Binary Search

Program Plan:

• Include the required header files.
• Declare the global variables.
• Declare the function template.
• Define main function.
  • Declare the required variables.
  • Get the array of elements.
  • Display the given display.
  • Sort the array in ascending order.
  • Display the sorted array.
  • Call the “search” function with the arguments.
  • If the “found” value is true, display the search element location. Otherwise display, “the element is not found”.
• Define the “search” function
  • Declare the variable
  • If “first” is greater than “last”, set “found” value as “false”.
  • Otherwise find the “mid” value.
    • If the “key” value is equal to “a [mid]”, set “found” value as “true” and also set “location” as “mid”.
    • If the “key” is less than “a [mid]”, call the “search” function with the arguments.
    • Otherwise, call the “search” function with the arguments.