Question

Lab Tasks: 1. Define a dynamic array class in DynamicArray .h and DynamicArray.cpp files, according to the following UML class diagram: DynamicArray - int arrySize; - int currentSize; int* arrayPtr; + DynamicArray(int size) // Explicit constructor, which you define- allocate space in dynamic memory for an integer array of the given size. + DynamicArray) // Explicit destructor, which you define-de allocate dynamic memory. + additem(int item): bool // Set the value of the next free element of the array to the parameter. // if the current array is full, create a new array with a double size, and copy the contents from the old array and delete the old array be the end. + getItem(int index): int // Return the value of the array element at the given index.

Following the instruction

This is c++ programming

Answer 1

#Answer

DynamicArray.h

#ifndef DYNAMICARRAY_H_INCLUDED
#define DYNAMICARRAY_H_INCLUDED

#endif // DYNAMICARRAY_H_INCLUDED

class DynamicArray {
private:

int arraysize;
int currentsize;
int* arrayPtr, *iterator;

public:
DynamicArray(int isize);

DynamicArray();

~DynamicArray();

bool additem(int item);

int getitem(int index);

int getcurrentsize();

void resize();
};

DynamicArray.cpp

#include <iostream>
#include <algorithm>
#include <cstddef>

using namespace std;

class DynamicArray {
private:

int arraysize;
int currentsize;
int* arrayPtr, *iterator;

public:
DynamicArray(int isize) {
arrayPtr = new int[isize];
currentsize=isize;
arraysize=isize;
iterator = arrayPtr;
}
DynamicArray() {
arraysize = 0;
currentsize = 0;
arrayPtr = nullptr;
iterator = arrayPtr;
}

~DynamicArray() {
delete[] arrayPtr;
arrayPtr = nullptr;
}

bool additem(int item) {
if(*iterator) {
*iterator = item;
++iterator;
}
else {
resize();
*iterator = item;
}
return true;
}

int getitem(int index) {
return (*arrayPtr + index);
}

int getcurrentsize() {
return currentsize;
}

void resize() {
int* temp = new int[arraysize];
currentsize+=arraysize;
std::copy(arrayPtr, arrayPtr + arraysize, temp);
delete [] arrayPtr;
arrayPtr = temp;
iterator = arrayPtr + arraysize;
}
};

int main() {
int isize,temp,i=0,j=0,avg=0,sum=0;
cout<<"Enter size of array: ";
cin>>isize;
DynamicArray d = DynamicArray(isize);
bool b = true;
while(j<2) {
i++;
cout<<"Enter value for array: ";
cin>>temp;
sum+=temp;
d.additem(temp);
if(i == isize) {
avg=sum/isize;
cout<<"Average: "<<avg<<endl;
i=0;
j++;
}
}
return 0;
}