Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

String wordMatch and integer numData are read from input. Then, numData alphabetically sorted strings are read from input and each string is appended to a

String wordMatch and integer numData are read from input. Then, numData alphabetically sorted strings are read from input and each string is appended to a vector. In the Find() function:

If wordMatch is found at index midIndex of the vector, output wordMatch, followed by " is found at index ", the value of midIndex, and a newline.

Else, if rangeSize is 1, output wordMatch, followed by " is not in the list" and a newline.

Ex: If the input is:

not 9 all dip mop new not pen put say til 

then the output is:

not is found at index 4 

Note: string1 == string2 returns true if the two strings are the same, and returns false otherwise

String wordMatch and integer numData are read from input. Then, numData alphabetically sorted strings are read from input and each string is appended to a vector. In the Find() function:

If wordMatch is found at index midIndex of the vector, output wordMatch, followed by " is found at index ", the value of midIndex, and a newline.

Else, if rangeSize is 1, output wordMatch, followed by " is not in the list" and a newline.

Ex: If the input is:

not 9 all dip mop new not pen put say til 

then the output is:

not is found at index 4 

Note: string1 == string2 returns true if the two strings are the same, and returns false otherwise.

*****NOTE!!!! THE CODE THE I HAVE PROVIDED CANNOT BE ALTERED. I CAN ONLY INPUT AFTER /*YOUR CODE GOES HERE*/

CANNOT CHANGE THE ELSE STATEMENT THAT ITS IN THE CODE

#include #include #include using namespace std;

void Find(vector itemList, string wordMatch, int startIndex, int endIndex) { int midIndex; int rangeSize;

rangeSize = (endIndex - startIndex) + 1; midIndex = (startIndex + endIndex) / 2; /* Your code goes here */ else { cout << wordMatch << " is not found at index " << midIndex << endl; } }

int main() { string wordMatch; vector dataList; int numData; int i; string item;

cin >> wordMatch; cin >> numData; for (i = 0; i < numData; ++i) { cin >> item; dataList.push_back(item); } Find(dataList, wordMatch, 0, dataList.size() - 1);

return 0; }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Visual Basic6 Database Programming

Authors: John W. Fronckowiak, David J. Helda

1st Edition

ISBN: 0764532545, 978-0764532542

More Books

Students also viewed these Databases questions

Question

What are the various types of corporate advertising? Describe them.

Answered: 1 week ago

Question

Discuss the relationship of team size to group cohesiveness.

Answered: 1 week ago

Question

d. Who are important leaders and heroes of the group?

Answered: 1 week ago