Question

in c++

Program 1 Write a program that sorts a vector of names alphabetically using the selection sort and then searches the vector for a specific name using binary search. To do that, you need to write three functions I. void selSort (vector string &v: sorts the vector using selection sort 2. void display (const vector <string & v): displays the vector contents . int binSearch (const vector <ing& v, string key): searches the vector for a key returns the index of the key if found and -1 if the index is not found Your main program should instantiate a vector of strings, names, and initialize t to the names specified below. Then call the functions in the order specified by the comments. int main() // Vector of string initialized to specific names vector<string> names "Joe Garcia","Amelia Perez" "Bob Haynes", "Tim Ducrest""Kevin Garcia", "Suzy Walter", "Fa Yi", "Robert James", "Mary Andres) //Call the function display to print the vector contents //Call the selSort function to sort the vector in ascending order / Call the function display to print the sorted vector contents l Call the binSearch function to search for "Kevin Garcia" /l Call the binSearch function to search for "Joe James return 0; Program 2: Write a recursive function mltiply that takes two integers x and y. The function should returrn the value of x timesy You may test your function by entering two integers: - 4 and 7 -1 and 5

Answer 1

1.

//C++ program to sort vector of strings alphabetically using selection sort in ascending order

#include <iostream>

#include <vector>

#include <string>

using namespace std;

// function declaration

void selSort(vector<string> &v);

void display(const vector<string> &v);

int binSearch(const vector<string> &v, string key);

int main() {

               vector<string> names = {"Joe Garcia","Amelia Perez","Bob Haynes","Tim Ducrest","Kevin Garcia","Suzy Walter","Fang Yi","Robert James","Mary Andres"};

               cout<<"Names : "<<endl;

               display(names);

               selSort(names); // sort the vector in ascending order

               cout<<"\nSorted Names : "<<endl;

               display(names);

               cout<<"\nSearch for Kevin Garcia : "<<binSearch(names,"Kevin Garcia")<<endl;

               cout<<"\nSearch for Joe James : "<<binSearch(names,"Joe James")<<endl;

               return 0;

}

// sorts the vector using selection sort

void selSort(vector<string> &v)

{

               size_t min;

               for(size_t i=0;i<v.size()-1;i++)

               {

                              min = i;

                              for(size_t j=i+1;j<v.size();j++)

                              {

                                             if(v[j].compare(v[min]) <0)

                                                            min = j;

                              }

                              if(min != i)

                              {

                                             string temp = v[i];

                                             v[i] = v[min];

                                             v[min] = temp;

                              }

               }

}

// displays the vector contents

void display(const vector<string> &v)

{

               for(size_t i=0;i<v.size();i++)

                              cout<<v[i]<<endl;

}

// searches the vector for a key returns the index of the key if found, -1 if the index is not found

int binSearch(const vector<string> &v, string key)

{

               int low = 0, high = v.size()-1;

               int mid;

               while(low <=high)

               {

                              mid = (low+high)/2;

                              if(v[mid].compare(key) == 0)

                                             return mid;

                              else if(v[mid].compare(key) > 0)

                                             high = mid-1;

                              else

                                             low = mid+1;

               }

               return -1;

}

//end of program

Output: