// This program demonstrates a Binary Search

//PLACE YOUR NAME HERE

#include

using namespace std;

int binarySearch(int [], int, int); // function prototype

const int SIZE = 16;

int main()

{

int found, value;

int array[] = {34,19,19,18,17,13,12,12,12,11,9,5,3,2,2,0}; // array to be searched

cout << "Enter an integer to search for:" << endl;

cin >> value;

found = binarySearch(array, SIZE, value); //function call to perform the binary search

//on array looking for an occurrence of value

if (found == -1)

cout << "The value " << value << " is not in the list" << endl;

else

{

cout << "The value " << value << " is in position number "

<< found + 1 << " of the list" << endl;

}

return 0;

}

int binarySearch(int array[],int numElems,int value) //function heading

{

int first = 0; // First element of list

int last = numElems - 1; // last element of the list

int middle; 0 // variable containing the current

// middle value of the list

while (first <= last)

{

middle = first + (last - first) / 2;

if (array[middle] == value)

return middle; // if value is in the middle, we are done

else if (array[middle]

last = middle - 1; // toss out the second remaining half of

// the array and search the first

else

first = middle + 1; // toss out the first remaining half of

// the array and search the second

}

return -1; // indicates that value is not in the array

}

The variable middle is defined as an integer. The program contains an assignment middle=first+(last-first)/2 Is the right-hand side necessarily an integer in memory? Explain how the middle is determined. How does this line of code affect the logic of the program? What will be the result of the program if you search for the values 19 and 12?

Take your time to explain step by step

Please not repeated the answer of another person.

thank you in advances!