Question

            You need to design a program for a pharmacy. The program must work on an ever changing price list that the pharmacy needs to keep track of. The user must be able to enter the number of different thermometers that they receive in a week. Then the user should be prompted for a price list on those thermometers. There are two versions of this program required.

1. The first version called pharmvector.cpp will output the list of prices in ascending and descending order as well as the median price. The program should use a vector for the storage container and two different versions of BubbleSort, one to make the list ascend and the other to make the list descend.
2. The second version call pharmpointer.cpp will output the list of prices in ascending and descending as well as the median price. The program should use an array for a storage container and two different versions of BubbleSort, one to make the list ascend with pointers and the other to make the list descend with pointers.

Answer 1

//pharmvector.cpp

#include <iostream>
#include <vector>
using namespace std;

int main() {
   int n;
   cout<<"enter number of thermometers:"<<endl;
   cin>>n;//taking input of number of thermometers
   vector<int>v(n);//declaring vector v to take inputs
   vector<int>ascending(v);//declaring vector ascending to store the ascended values
   vector<int>descending(v);// declaring vector descending to store the descended values
   cout<<"enter the prices of thermometer:"<<endl;
   int i,j;
   //taking inputs
   for( i=0;i<n;i++)
   {
   cin>>v[i];//taking input in v[i]
   ascending[i]=v[i];//copying into ascending[i]
   descending[i]=v[i];//copying into descending[i]
   }
   // we are writing both ascending and descending bubble sort at once so that it will be fast
   for(i=0;i<n;i++)
   {
   for(j=i+1;j<n;j++)
   {
   // for ascending if the present value is greater than the one with we are comparing, swap
   if(ascending[i]>ascending[j]) swap(ascending[i],ascending[j]);
   // for descending if the present value is lesser than the one with we are comparing swap
   if(descending[i]<descending[j]) swap(descending[i],descending[j]);
   }
   }
   cout<<"in ascending order:"<<endl;
   //printing ascending list
   for( i=0;i<n;i++)
   {
   cout<<ascending[i]<<" ";
   }
   cout<<endl;
  
   cout<<"in descending order:"<<endl;
   //printing descending list
   for( i=0;i<n;i++)
   {
   cout<<descending[i]<<" ";
   }
   cout<<endl;
   float median;
   //if the list is even the median is average of the two middle elements
   //we are type casting with float because some times the median may be in floating points
   if(n%2==0) median=((float)ascending[n/2]+(float)ascending[n/2-1])/2;
   //else the median is the middle element
   else median=ascending[n/2];
   cout<<"median:"<<median<<endl;
  
   return 0;
}

#include <iostream>

using namespace std;

int main() {
   int n;
   cout<<"enter number of thermometers:"<<endl;
   cin>>n;//taking input of number of thermometers
   int v[n];//declaring vector v to take inputs
   int ascending[n];//declaring vector ascending to store the ascended values
   int descending[n];// declaring vector descending to store the descended values
   cout<<"enter the prices of thermometer:"<<endl;
   int i,j;
   //taking inputs
   for( i=0;i<n;i++)
   {
   cin>>*(v+i);//taking input in v[i]
   *(ascending+i)=*(v+i);//copying into ascending[i]
   *(descending+i)=*(v+i);//copying into descending[i]
   }
   // we are writing both ascending and descending bubble sort at once so that it will be fast
   for(i=0;i<n;i++)
   {
   for(j=i+1;j<n;j++)
   {
   // for ascending if the present value is greater than the one with we are comparing, swap
   if(*(ascending+i)>*(ascending+j)) swap(*(ascending+i),*(ascending+j));
   // for descending if the present value is lesser than the one with we are comparing swap
   if(*(descending+i)<*(descending+j)) swap(*(descending+i),*(descending+j));
   }
   }
   cout<<"in ascending order:"<<endl;
   //printing ascending list
   for( i=0;i<n;i++)
   {
   cout<<*(ascending+i)<<" ";
   }
   cout<<endl;
  
   cout<<"in descending order:"<<endl;
   //printing descending list
   for( i=0;i<n;i++)
   {
   cout<<*(descending+i)<<" ";
   }
   cout<<endl;
   float median;
   //if the list is even the median is average of the two middle elements
   //we are type casting with float because some times the median may be in floating points
   if(n%2==0) median=((float)*(ascending+n/2)+(float)*(ascending+n/2-1))/2;
   //else the median is the middle element
   else median=*(ascending+n/2);
   cout<<"median:"<<median<<endl;
  
   return 0;
}

if you are satisfied please upvote or if you have any doubts post them in comment section

Happy learning