LAB 8.2 Working with the Binary Search Bring in program binary_search.cpp from the Lab 8 folder. This is Sample Program 8.2 from the Pre-lab Reading Assignment. The code is the following: // 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() 7 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); if (found = -1) else // function call to perform the binary search // on array looking for an occurrence of value cout << "The value << value << is not in the list" << endl; cout << "The value << value << is in position number" << found + 1 <
LAB 8.2 Working with the Binary Search Bring in program binary_search.cpp from the Lab 8 folder. This is Sample Program 8.2 from the Pre-lab Reading Assignment. The code is the following: // 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() 7 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); if (found = -1) else // function call to perform the binary search // on array looking for an occurrence of value cout << "The value << value << is not in the list" << endl; cout << "The value << value << is in position number" << found + 1 <
Chapter22: Sequence Control
Section: Chapter Questions
Problem 6SQ: Draw a symbol for a solid-state logic element AND.
Related questions
Question
solve this
![LAB 8.2 Working with the Binary Search
Bring in program binary_search.cpp from the Lab 8 folder. This is Sample
Program 8.2 from the Pre-lab Reading Assignment. The code is the following:
// This program demonstrates a Binary Search
// PLACE YOUR NAME HERE
#include <iostream>
using namespace std;
int binarySearch (int [], int, int); // function prototype
const int SIZE = 16;
int main()
7
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);
if (found = -1)
else
// function call to perform the binary search
// on array looking for an occurrence of value
cout << "The value << value << is not in the list" << endl;
cout << "The value << value << is in position number"
<< found + 1 <<of the list" << endl;
return 0;
binarySearch](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F966ba16d-db34-4747-8867-9802a3958816%2Fcd9cae54-6442-46e5-8704-f3e448008bae%2Fw0glrd_processed.jpeg&w=3840&q=75)
Transcribed Image Text:LAB 8.2 Working with the Binary Search
Bring in program binary_search.cpp from the Lab 8 folder. This is Sample
Program 8.2 from the Pre-lab Reading Assignment. The code is the following:
// This program demonstrates a Binary Search
// PLACE YOUR NAME HERE
#include <iostream>
using namespace std;
int binarySearch (int [], int, int); // function prototype
const int SIZE = 16;
int main()
7
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);
if (found = -1)
else
// function call to perform the binary search
// on array looking for an occurrence of value
cout << "The value << value << is not in the list" << endl;
cout << "The value << value << is in position number"
<< found + 1 <<of the list" << endl;
return 0;
binarySearch
![// data ini
11
List of values in an orderd array, the number of
elements in the array, and the value searched for
in the array
// data returned: Position in the array of the value or -1 if value
11
not found
int binarySearch (int array[], int numElems, int value) //function heading
int first 0;
int last numElems -1;
int middle;
// First element of list
1/ last element of the list
// variable containing the current
// middle value of the list
while (first < last)
middle first (last first) / 2;
if (array[middle] value)
return middle;
else if (array(middle)] < value)
last middle - 1;
else
first middle + 1;
4
// it value is in the middle, we are done
// toss out the second remaining half of
// the array and search the first
// toss out the first remaining half of
// the array and search the second.
}
return -1;
// indicates that value is not in the array
Exercise 1: The variable middle is defined as an integer. The program contains
the assignment statement middle-first+ (last-first) /2. Is the right side
of this statement necessarily an integer in computer memory? Explain how
the middle value is determined by the computer. How does this line of
code affect the logic of the program? Remember that first, last, and
middle refer to the array positions, not the values, stored in those array
positions.
Exercise 2: Search the array in the program above for 19 and then 12. Record
what the output is in each case.
Note that both 19 and 12 are repeated in the array. Which occurrence of
19 did the search find?
Which occurrence of 12 did the search find?
Explain the difference.
Exercise 3: Modify the program to search an array that is in ascending order.
Make sure to alter the array initialization.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F966ba16d-db34-4747-8867-9802a3958816%2Fcd9cae54-6442-46e5-8704-f3e448008bae%2Fic90nh_processed.jpeg&w=3840&q=75)
Transcribed Image Text:// data ini
11
List of values in an orderd array, the number of
elements in the array, and the value searched for
in the array
// data returned: Position in the array of the value or -1 if value
11
not found
int binarySearch (int array[], int numElems, int value) //function heading
int first 0;
int last numElems -1;
int middle;
// First element of list
1/ last element of the list
// variable containing the current
// middle value of the list
while (first < last)
middle first (last first) / 2;
if (array[middle] value)
return middle;
else if (array(middle)] < value)
last middle - 1;
else
first middle + 1;
4
// it value is in the middle, we are done
// toss out the second remaining half of
// the array and search the first
// toss out the first remaining half of
// the array and search the second.
}
return -1;
// indicates that value is not in the array
Exercise 1: The variable middle is defined as an integer. The program contains
the assignment statement middle-first+ (last-first) /2. Is the right side
of this statement necessarily an integer in computer memory? Explain how
the middle value is determined by the computer. How does this line of
code affect the logic of the program? Remember that first, last, and
middle refer to the array positions, not the values, stored in those array
positions.
Exercise 2: Search the array in the program above for 19 and then 12. Record
what the output is in each case.
Note that both 19 and 12 are repeated in the array. Which occurrence of
19 did the search find?
Which occurrence of 12 did the search find?
Explain the difference.
Exercise 3: Modify the program to search an array that is in ascending order.
Make sure to alter the array initialization.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 1 steps
Recommended textbooks for you
Delmar's Standard Textbook Of Electricity
Electrical Engineering
ISBN:
9781337900348
Author:
Stephen L. Herman
Publisher:
Cengage Learning
Delmar's Standard Textbook Of Electricity
Electrical Engineering
ISBN:
9781337900348
Author:
Stephen L. Herman
Publisher:
Cengage Learning