Parallel Arrays Summary In this lab, you use what you have learned about paralle
ID: 3592333 • Letter: P
Question
Parallel Arrays
Summary
In this lab, you use what you have learned about parallel arrays to complete a partially completed C++ program. The program should:
Either print the name and price for a coffee add-in from the Jumpin’ Jive Coffee Shop
Or it should print the message Sorry, we do not carry that.
Read the problem description carefully before you begin. The file provided for this lab includes the necessary variable declarations and input statements. You need to write the part of the program that searches for the name of the coffee add-in(s) and either prints the name and price of the add-in or prints the error message if the add-in is not found. Comments in the code tell you where to write your statements.
Instructions
Study the prewritten code to make sure you understand it.
Write the code that searches the array for the name of the add-in ordered by the customer.
Write the code that prints the name and price of the add-in or the error message, and then write the code that prints the cost of the total order.
Execute the program by clicking the "Run Code" button at the bottom of the screen. Use the following data:
Cream
Caramel
Whiskey
chocolate
Chocolate
Cinnamon
Vanilla
-----------------------------
This is what i have so far:
// JumpinJava.cpp - This program looks up and prints the names and prices of coffee orders.
// Input: Interactive
// Output: Name and price of coffee orders or error message if add-in is not found
#include <iostream>
#include <string>
using namespace std;
int main()
{
// Declare variables.
string addIn; // Add-in ordered
const int NUM_ITEMS = 5; // Named constant
// Initialized array of add-ins
string addIns[] = {"Cream", "Cinnamon", "Chocolate", "Amaretto", "Whiskey"};
// Initialized array of add-in prices
double addInPrices[] = {.89, .25, .59, 1.50, 1.75};
bool foundIt = false; // Flag variable
int x; // Loop control variable
double orderTotal = 2.00; // All orders start with a 2.00 charge
int findItem();
// Get user input
cout << "Enter coffee add-in or XXX to quit: ";
cin >> addIn;
// Write the rest of the program here.
findItem();
foundIt = false
x = 0
while(x < NUM_ITEMS)
if addIn = addIns[x]
foundIt = true
orderTotal = addInPrices[x]
endif
x = x + 1
endwhile
if(foundIt = true)
{
cout << "The price of" << addIns[x] << "is" << addInPrices[x] << "." << endl;
}
else
{
cout << "Sorry, we do not carry that." << endl;
}
return 0;
} // End of main()
Explanation / Answer
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char** argv) {
// Declare variables.
string addIn; // Add-in ordered
const int NUM_ITEMS = 5; // Named constant
// Initialized array of add-ins
string addIns[] = {"Cream", "Cinnamon", "Chocolate", "Amaretto", "Whiskey"};
// Initialized array of add-in prices
double addInPrices[] = {.89, .25, .59, 1.50, 1.75};
bool foundIt = false; // Flag variable
int x; // Loop control variable
double orderTotal = 2.00; // All orders start with a 2.00 charge
cout<<" Coffee Add-ins :Cream, Cinnamon, Chocolate, Amaretto, Whiskey ";
// Get user input
cout << " Enter coffee add-in or XXX to quit: ";
cin >> addIn;
if(!((addIn == "XXX")||(addIn == "xxx"))){ // if it is not quit then checks for the addin item
foundIt = false;
x = 0;
// performs until the num_items or until found match
do{
if (addIn == addIns[x]){//if the match found the display the message
foundIt = true;
cout << " The price of " << addIns[x] << " is " << addInPrices[x] << "." << endl;
orderTotal = addInPrices[x];
}
x = x + 1;
}while((x < NUM_ITEMS) &&(!foundIt));
if(!foundIt) //if not found then displays the message
{
cout << "Sorry, we do not carry that." << endl;
}
}
return 0;
}
Sample Run:
Coffee Add-ins :Cream, Cinnamon, Chocolate, Amaretto, Whiskey
Enter coffee add-in or XXX to quit: Cream
The price of Cream is 0.89.
RUN SUCCESSFUL (total time: 2s)
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.