// DYNARR.CPP
// MICHAEL LEVY ,All Rights Reserved
#include <iostream.h>
#include <process.h>
#include "dynarr.h"
///constructors
template <class T>
DynArr<T>::DynArr()
{
 arr=(T*)NULL;
 size=0;
 style='D';
}


template <class T>
DynArr<T>::DynArr(int s)
{
 style = 'F';
 arr = new T[s];
 if(arr==NULL)
 { cerr<<"Bad allocaion ,sorry not enough memory ?!\n";  exit(0); }
 size = s;
}


template <class T>
DynArr<T>::DynArr(const DynArr& rhs)
{
 // Why to write the same code twice ? ,we  use operator '='
 // the only difference that we don't return a value here because ,
 // it's a constructor
 operator=(rhs);
}


template <class T>
DynArr& DynArr<T>::operator=(const DynArr& rhs)
{
 if(this==&rhs) return *this;
 if(arr!=NULL)
   delete []arr;
 arr=new T[rhs.size];
 for(int i=0; i<rhs.size; i++)
    arr[i] = rhs.arr[i];
 size=rhs.size;
 style = rhs.style ;
 return *this ;
}


// apply function
template <class T>
T& DynArr<T>::operator[](int index)
{
   if(index < size)
       return arr[index];
   else if(style=='F')
          {
           cout<<"Overflow in Array\n";
           exit(1);
          }
        else
            {
             T* new_ptr= new T[index+1];   int i;
             for( i=0; i<size; i++)
                new_ptr[i]=arr[i];
             delete []arr;
             arr=new_ptr;
             for(i=size; i<=index; i++)
               arr[i] = -1;
             size = index +1;
             return arr[index];
            }
}



template <class T>
void DynArr<T>::Swap(T& a,T& b)
{
 T c;
 c=a;
 a=b;
 b=c;
}

template <class T>
void DynArr<T>::SelectionSort(char order='a')
{
 int small,i,j;
if(order=='a')
{
 for(i=0; i< size-1; i++)
 {
   small=i;
   for(j=i+1; j<size; j++)
     if(arr[j] < arr [small])
       small=j;


   Swap(arr[i],arr[small]);
 }
}
else
{
 for(i=0; i< size-1; i++)
 {
   small=i;
   for(j=i+1; j<size; j++)
     if(arr[j] > arr [small])
       small=j;


   Swap(arr[i],arr[small]);
 }
}
}