Question

Please answer this question clearly and correctly! the code should be handwritten if all possible!! ALSO MAKE SURE IT IS WRITTEN IN C++! thank you so much in advance and I will upvote when done right!

(8 points) Create a class called resizeableArray. Include an int pointer arrayPtr variable that points to a dynamic array, a capacity variable that holds the dynamic array maximum size and a currentSize variable that has the current number of elements assigned in the dynamic array as private variables. Include public functions addElement to add an element to the array and removeElement to remove an element from the array. Include a constructor that takes no parameters that creates an array of capacity 16. Include a constructor that takes a parameter and creates an array of capacity equal to the parameter. Create a private function resizeArray that resizes the array when full (doubles the capacity) or when under quarter capacity (halves the capacity). The resizeArray function needs to resize the array, copy current array elements into newly resized array, and properly remove old array to avoid memory leak.

Answer 1

//4
class resizeableArray
{
   int *arrayPtr;
   int capacity,currentSize;
   public:
   //default constructor
   resizeableArray()
   {
       capacity=16;
       currentSize=-1;
       arrayPtr = new int[16];
       //initializing all values with -1
       for(int i=0;i<16;i++)arrayPtr[i]=-1;  
   }
   //parameterized constructor
   resizeableArray(int n)
   {
           capacity=n;
       currentSize=-1;
       arrayPtr = new int[n];
       //initializing all values with -1
       for(int i=0;i<n;i++)arrayPtr[i]=-1;
      
   }
   //method to add element to array
   void addElement(int n)
   {
       if(currentSize+1 < capacity)
       {
               arrayPtr[currentSize+1]=n;
               currentSize++;
       }
       else
       {//if array is full
           resizeArrayup();//then resizing it
           addElement(n);   //then adding element
       }
   }
   void removeElement(int n)
   {
       //removes n from array
       int i=0;
       for(i=0;i<=currentSize;i++)
       {
           if(arrayPtr[i]==n)break;//if found  
       }  
       for(;i<=currentSize-1;i++)
       arrayPtr[i]=arrayPtr[i+1];
       arrayPtr[i]=-1;
       currentSize--;
       if(currentSize<capacity/4)
       resizeArraydown();
   }
   //method to resize array//increases size
   void resizeArrayup()
   {
           int *n = new int[capacity*2];
           for(int i=0;i<=currentSize;i++)
           n[i]=arrayPtr[i];
           for(int i=currentSize+1 ;i<capacity*2;i++)
           n[i]=-1;
           arrayPtr=n;
           capacity=capacity*2;
   }
   //decreases the size
   void resizeArraydown()
   {
           int *n = new int[capacity/2];
           for(int i=0;i<=currentSize;i++)
           n[i]=arrayPtr[i];
           for(int i=currentSize+1 ;i<capacity/2;i++)
           n[i]=-1;
           arrayPtr=n;
           capacity=capacity/2;
   }
};