email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the
Contact list: Binary Search
A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name.
Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the
int FindContact(ContactInfo contacts[], int size, string contactName)
Ex: If the input is:
3 Frank 867-5309 Joe 123-5432 Linda 983-4123 Frankthe output is:
comparisons: 2 867-5309Note: your function can assume the contacts array will be sorted on the contact names in ascending order.
Using this code:
#include <iostream>
using namespace std;
struct ContactInfo {
string name;
string number;
};
int FindContact(ContactInfo contacts [], int size, string contactName) {
/* implement the function here */
}
int main() {
ContactInfo contacts[10];
string userInput;
string searchName;
int numInput;
cin >> numInput;
for (int i = 0; i < numInput; ++i) {
cin >> contacts[i].name;
cin >> contacts[i].number;
}
cin >> searchName;
int index = FindContact(contacts, numInput, searchName);
if (index!=-1)
cout << contacts[index].number;
else
cout << "not found";
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
