Help please, Using the binsearch.cpp file, implement and test a recursive binary search function. The main function should fill an array of 10 slots with integers: 1 3 5 7 9 11 13 15 17 19 It will then ask the user to enter a number to look for. It will then call binarySearch and display the returned result. For example, "The number was found in position 5" or "The number was not found". ---------------------The File which needs to be filled in where it says TODO--------------------- #include <iostream> using namespace std; // Compiler: g++ // -------------------------------------------- // x is what we are looking for in L; first and last are slot numbers // This recursive function returns the slot number in which x was found // or -1 int binarySearch(int L[], int x, int first, int last) { // Be sure to check for first > last and // first == last cases to // end the recursion now // TODO: // TODO: the mid is found... cout << "comparing against an element in slot " << middle << endl; // TODO: The rest based on the notes to recurse } int main() { int A[10] = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 }; int e; // to look for this cout << "What do you want to look for? "; cin >> e; // Call binarySearch here to look for e in A // TODO: fix the call to binarySearch int respos = binarySearch(); if (respos == -1) cout << "Element not found" << endl; else cout << "Found it in position " << respos+1 << endl; }
Help please, Using the binsearch.cpp file, implement and test a recursive binary search function.
The main function should fill an array of 10 slots with integers:
1 3 5 7 9 11 13 15 17 19
It will then ask the user to enter a number to look for.
It will then call binarySearch and display the returned result.
For example, "The number was found in position 5" or "The number was not found".
---------------------The File which needs to be filled in where it says TODO---------------------
#include <iostream>
using namespace std;
// Compiler: g++ // --------------------------------------------
// x is what we are looking for in L; first and last are slot numbers
// This recursive function returns the slot number in which x was found
// or -1
int binarySearch(int L[], int x, int first, int last) {
// Be sure to check for first > last and
// first == last cases to
// end the recursion now
// TODO:
// TODO: the mid is found...
cout << "comparing against an element in slot " << middle << endl;
// TODO: The rest based on the notes to recurse }
int main()
{ int A[10] = { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 };
int e;
// to look for this
cout << "What do you want to look for? ";
cin >> e; // Call binarySearch here to look for e in A
// TODO: fix the call to binarySearch
int respos = binarySearch();
if (respos == -1) cout << "Element not found" << endl;
else cout << "Found it in position " << respos+1 << endl;
}
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
