Question

solve it in c+*

Part II: Dynamic Arrays and Pointer Arithmetic Q5: Implement a subset function for a dynamic array which returns a new dynamic array that is a subset of the original. (15pt) input parameters: array - (the array and any related parameters) start - index of the first element end - index of the last element This function returns a new dynamic array containing the elements from the start thru the end indices of the original array. All array indexing must be done using pointer arithmetic. Also implement output function to print every element of the given dynamic array. For example, given the array: 49 96 99 47 76 29 22 16 30 22 25 63 40 38 67 65 25 84 89 4 If the start and end positions were 5 and 9, return a new dynamic array: 29 22 16 30 22 Use following main() to test your function. int main() { int size = 20; int *p = new int[size] {49,96,99,47,76,29,22,16,30,22,25,63,40,38,67,65,25,84,89,4}; output(p, size); int *q = subSet(p, size, 5, 9); output(q, 9-5+1); return 0; } Answer:

Answer 1

#include <iostream>

using namespace std;
void output(int *p,int size)
{
for(int i=0;i<size;i++)//print each of the array value
{
cout<<p[i]<<" ";
}
cout<<endl;
}
int* subSet(int *p,int size,int start,int end)
{
  
int len=end-start+1;//length of sub array
int *sub_arr=new int[len];//declare dynamic array of size len
for(int i=0;i<len;i++)
{
sub_arr[i]=p[i+start];//assign the correct values
}
return sub_arr;//return array
}
int main()
{
int size=20;
int *p=new int[size] {49,96,99,47,76,29,22,16,30,22,25,63,40,38,67,65,25,84,89,4};
output(p,size);
int *q=subSet(p,size,5,9);
output(q,9-5+1);

return 0;
}

comment if any doubts