Question

Submissions) Part A Type and run the Array class template discussed in lecture (Templates notes). Modify the class by adding sort member function (refer to Algorithm Analysis notes for sorting algorithms) Sample usage: a. sort(); Add the needed code in main to test your function.

Answer 1

#include<iostream>
using namespace std;
template<class T>
class Array{
   private:
       T *ptr;
       int size;
   public:
       Array(T arr[],int s);
       void print();
       void sort();
      
};
template<class T>
Array<T>::Array(T arr[],int s)
{
   ptr= new T[s];
   size=s;
   for(int i=0;i<size;i++)
   {
       ptr[i]=arr[i];
   }
}
template<class T>
void Array<T>::print(){
   for(int i=0;i<size;i++)
   {
       cout<<" "<<*(ptr+i);
   }
   cout<<endl;
}
template<class T>
void Array<T>::sort(){

T t;

for(int a=1; a<size; a++)
for(int b=size-1; b>=a; b--)
if(ptr[b-1] > ptr[b]) {
t = ptr[b-1];
ptr[b-1] = ptr[b];
ptr[b] = t;
}

}
int main()
{
   int arr[5]={1,2,3,4,5};
   string arr1[4]={"Hello","2437","Spring","20!"};
   Array<int> a(arr,5);
   Array<string> s(arr1,4);
   cout<<"After sorting the sorted output are:\n";
   a.sort();
   s.sort();
   a.print();
   s.print();
   return 0;
  
}

OUTPUT:-

After sorting the sorted output are:
1 2 3 4 5
20! 2437 Hello Spring