Question

Write in C++:

Please create a shopping list using the STL list container, then follow the following instructions.

1. Create an empty list.
2. Append the items, "eggs," "milk," "sugar," "chocolate," and "flour" to the list. Print the list.
3. Remove the first element from the list. Print the list.
4. Insert the item, "coffee" at the beginning of the list. Print the list.
5. Find the item, "sugar" and replace it with "honey." Print the list.
6. Insert the item, "baking powder" before "milk" in the list. Print the list.

======================================

Next, here is the pseudocode for a function that performs a binary search on an array:

*********************

Set first index to 0.

Set last index to the last subscript in the array.

Set found to false.

Set position to −1.

While found is not true and first is less than or equal to last

Set middle to the subscript halfway between array[first] and array[last].

If array[middle] equals the desired value

Set found to true.

Set position to middle.

Else If array[middle] is greater than the desired value

Set last to middle − 1.

Else

Set first to middle + 1.

End If.

End While.

Return position.

*********************

You may use the following numbers for your binary search.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9

Answer 1

Shopping_list.cpp

#include<iostream>
#include <list>
#include <iterator>
#include <string>
#include <algorithm>
using namespace std;
int main(){
   list <string> slist;
   slist.push_back("eggs");
   slist.push_back("milk");
   slist.push_back("sugar");
   slist.push_back("chocolate");
   slist.push_back("flour");
   list <string> :: iterator it;
for(it = slist.begin(); it != slist.end(); ++it)
cout << *it << " ";
slist.pop_front();
cout<<endl<<"list after removing first element"<<endl;
for(it = slist.begin(); it != slist.end(); ++it)
cout << *it << " ";
slist.push_front("coffee");
for(it = slist.begin(); it != slist.end(); ++it)
cout << *it << " ";
cout<<endl;
for(it = slist.begin(); it != slist.end(); ++it){
       if(*it=="sugar"){
           *it="honey";
           break;
}
}
   for(it = slist.begin(); it != slist.end(); ++it)
cout << *it << " ";
cout<<endl;
it = std::find(slist.begin(),slist.end(), "milk");
slist.insert(it,"baking powder");
for(it = slist.begin(); it != slist.end(); ++it)
cout << *it << " ";
cout<<endl;
  
  
}

Binary_search.cpp

#include<iostream>
using namespace std;
int binarysearch(int array[],int first,int last,int value,int position){
   bool found =false;
   while(found!=true && first<=last){
       int middle = (first+last)/2;
      
       if(array[middle]==value){
           found=true;
           position=middle;
       }
       else if(array[middle]>value){
           last = middle-1;
       }
       else{
           first= middle+1;
       }
       cout<<middle<<" " <<first<<" "<<last<<endl;
   }
   return position+1;
}
int main(){
   int arr[]={0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
   int size = sizeof(arr) / sizeof(arr[0]);
   int first=0,last =size;
   int position =-1;
   int value =0;
   cout<<binarysearch(arr,first,last,value,position);
   return 0;
}