Question

1. Add a menu item to your menu to Search using a Binary String Search function. Create a customerNames array using the following const int NUM_NAMES -10; string customerNames NUM NAMES]- {"Baldwin, Alex", "Gosling, Ryan", "Bullock, Sandra", "Townsend, Pete", Trump, Donald" "Markle, Megan", "Lopez, Jennifer" "Urban, Keith" "Stone, Emma", "Grande, Ariana"; and add a customerlD array. This binarySearch should be in a separate function with appropriate parameters and should use a bubble sort (NOT a Selection sort) which is also used to dual sort the Customer Names and Customer Id 2. Add another menu item to your menu to dual sort the Customer Names and Customer Id with a bubble sort. This bubble sort and swap should be functions within your program which pass parameters Your menu should loop until the user selects quit. (Ctrl) .

THIS IS FOR C++ PROGRAMMING USING VISUAL STUDIO

THE PROGRAM NEEDS TO BE IN C++ PROGRAMMING

#include "pch.h"
#include
#include
using namespace std;

// Function prototype
void displayMessage(void);
void totalFees(void);
double calculateFees(int);

double calculateFees(int bags) {
   return bags * 30.0;
}

void displayMessage(void) {
   cout << "This program calculates the total amount of checked bag fees." << endl;

}

void totalFees() {
   double bags = 0;
   cout << "Enter the amount of checked bags you have." << endl;
   cout << "5 CHECKED BAG LIMIT" << endl;
   cout << "How many checked bags do you have? ";
   cin >> bags;
   if (bags < 0 || bags > 5) {
       cout << "Checked Bags must be in the range 0-5";
       return;
   }
   // Display total amount of checked bag fees
   cout << "\nChecked Bag Fees\n";
   cout << "------------------\n";
   cout << setprecision(2) << fixed << showpoint;
   cout << "Total Checked Bag Fees : " << setw(8) << calculateFees(bags) << endl;
}

int main() {

   int choice = 0;
   bool close = false;
   do {
       cout << "\n[1] - Display Message" << endl;
       cout << "[2] - Calculate Total Fees" << endl;
       cout << "[3] - Quit" << endl;
       cout << "Choice: ";
       cin >> choice;
       switch (choice) {

       case 1:
           displayMessage();
           break;
       case 2:
           totalFees();
           break;
       case 3:
           close = true;
           break;
       default:
           cout << "You have entered an invalid choice" << endl;
           break;
       }
       if (close) {
           cout << "Thanks for using the application." << endl;
           break;
       }
       else {
           continue;
       }

   } while (true);
   return 0;

}

Answer 1

Hi,

(please note:I have not understood the purpose of the code pasted in the question. As it doesn't have any connection to the question posted.)

if you want to add sorting and search functionalities to above code you can do the same adding case 4 and case 5)

please find the code and output attached below.

Kindly upvote.

#include <iostream>
#include<string.h>
#include<stdlib.h>
using namespace std;

void dualSort(string[], int[], int);
void binarySearch(string[],int[],int,int);
int main()
{
const int NUM_NAMES = 10;
string customerNames[NUM_NAMES]={"Baldwin,Alex",
"Gosling,Ryan",
"Bullock,Sandra",
"Townsend,pete",
"Trump,Donald",
"Markle,Megan",
"Lopez,Jennifer",
"Urban,Keith",
"Stone,Emma",
"Grande,Ariana"};
int customerId[NUM_NAMES]={55,89,23,10,56,88,90,33,22,11};   
int count = 0;
int choice;
  
  
do
   {
       cout << "Menu: Select your option\n\n";
       cout << "(1) Dual Sort(using bubble sort two arrays)\n";
       cout << "(2) Binary Search using dual sort\n";
       cout << "(3) Quit.\n\n";
       cout << "Enter your choice ---> ";

       cin >> choice;

       if (1 <= choice && choice <= 5)
       {  
           switch (choice)
           {
           case 1:
           cout << "The customer names and Id's are: " << endl;
for (int count = 0; count < NUM_NAMES; count++)
{
cout << "Before sort:" << customerNames[count] << "\n" << customerId[count] << " " << endl;
}
  
               dualSort(customerNames,customerId, NUM_NAMES);
               break;
           case 2:
           int custIdreq;
           cout << "Enter the customer Id to be searched" << endl;
           cin >> custIdreq;
           dualSort(customerNames,customerId,NUM_NAMES);
               binarySearch(customerNames,customerId,custIdreq,NUM_NAMES);
               break;
           default:
               cout << "Invalid choice. Enter again.\n\n";
               break;
           }
       }  
   }
   while (choice != 3);

}
void str_swap(string *str1, string *str2)
{
string temp_custname = *str1;
*str1 = *str2;
*str2 = temp_custname;
}
void int_swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
void binarySearch(string customerNames[], int customerId[],int value, int n)
{
//First as requested in question do dual sort(bubble sort) then do binary Search
  
int low = 0, high = n - 1;
int index;
while (low <= high)
{
  
index = (high + low) / 2;
if (customerId[index] == value) {
  
  
cout << "customer having custId "<< value <<
" is "
<< customerNames[index] <<
endl;
return;
}
else if (customerId[index] > value)
high = index - 1;
else
low = index + 1;
}
cout << "Sorry, no such customer Id is found \n";
  
}
void dualSort(string customerNames[], int customerId[], int NUM_NAMES)
{
char s1[100],s2[100];
for(int i=0;i<NUM_NAMES-1;i++)
{

for(int j=i+1;j<NUM_NAMES;j++)
{

if(customerId[j]<customerId[i])
{
str_swap(&customerNames[i],&customerNames[j]);
int_swap(&customerId[i],&customerId[j]);
}

}

}
for (int count = 0; count < NUM_NAMES; count++)
{
cout << "After Sort:" << customerNames[count] << "\n" << customerId[count] << " " << endl;
}

}

Menu: Select your option (1) Dual Sort (using bubble sort two arrays) (2) Binary Search using dual sort (3) Quit. Enter your choice -> 1

Enter vour choice ---> 1 The customer names and Id's are: Before sort:Baldwin,Alex Before sort:Gosling, Ryan Before sort:Bullock, Sandra Before sort:Townsend,pete Before sort:Trump, Donald Before sort:Markle, Megan Before sort:Lopez, Jennifer Before sort:Urban, Keith 33 Before sort: Stone Emma 22 Before sort: Grande,Ariana After Sort:Townsend, pete After Sort:Grande,Ariana After Sort: Stone, Ema22 After Sort:Bullock, Sandra After Sort:Urban, Keith 33 After Sort:Baldwin,Alex 55 After Sort: Trump, Donald 56 After Sort:Markle, Megan 88 After Sort: Gosling, Ryan 89 After Sort:Lopez, Jennifer Menu: Select your option 89 23 10 56 10 23 90

Dual Sort (using bubble sort two arrays) (2) Binary Search using dual sort (3) Ouit. Enter vour choice ---> 2 Enter the customer Id to be searched 10 After Sort: Townsend, pete After Sort:Grande,Ariana After Sort:Stone, Ermma 22 After After Sort:Urban, Keith 33 After Sort:Baldwin,Alex 55 After Sort: Trump, Donald 56 After Sort:Markle, Megan 88 After Sort:Gosling, Ryan 89 After Sort: Lopez, Jennifer customer having custId 10 is Townsend, pete Menu: Select your option 10 Sort: Bullock, Sandr 90 Dual Sort (using bubble sort two arrays) (2) Binary Search using dual sort (3) Ouit.