13.5: Lab-AL (Prof H) binary &linear search Benchmark (array[mi } { found= true; position = middle; else else if (array [middle] > value) // If value is in lower half last = middle - 1; return position; first = middle + 1; Run 10 11 12 13 14 15 VALUE main.cpp 1 2 #include 3 using namespace std; 4 5 6 7 8 9 //8.8 Search Benchmarks // Global Constants const int ARRAY SIZE = 20; // The array size Tound at ma // If value is in upper half // Function prototype int linearSearchBench(int[], int, int); int binarySearchBench(int [], int, int); CONSOLE SHELL int main() { int comparisons; // To hold the number of comparisons. Reset workspace Tutorial Help/