Question

(C++ program )Write a function that accepts an int array and the array’s size as arguments. The function should create a new array that is one element larger than the argument array. The first element of the new array should be set to 0. Element 0 of the argument array should be copied to the element 1 of the new array. Element 1 of the argument array should be copied to element 2 of the new array, and so forth. The function should return a pointer to the new array.

Hint: You must create a “new” array in the freestore ( the heap ) for this to work correctly.

Here is the required starting code below.

// Element Shifter

#include

using namespace std;

// Prototype

int *shift(int[], int);

void showArray(int[], int);

int main()

{

const int SIZE = 5;

int values[SIZE] = { 1,2,3,4,5 };

// Display the contents of the array.

cout << "The contents of the original array are:\n";

showArray(values, SIZE);

// Call the shift function to make a copy of

// the array, with the elements shifted one

// position toward the end if the array.

int *arrCopy = shift(values, SIZE); //Gets address of the new array in freestor

   // Display the contents of the original array

//to prove it was not damaged

cout << "The contents of the original array are:\n";

showArray(values, SIZE);

// Display the contents of the new array.

cout << "The contents of the new array are:\n";

showArray(arrCopy, SIZE+1);

return 0;

}

// The shift function accepts an int

// array and an int indicating the array's

// size. The function returns a pointer to

// an array that is one element larger than

// the array that was passed as an argument.

// The elements of the argument array are

// copied to the new array, shifted one

// position toward the end of the array.

int *shift(int arr[], int size)

{

int junk = 0; //Simkin temp junk code so it will compile

return &junk; //Simkin temp junk code so it will compile

}

// The showArray function displays the contents

// of an int array.

void showArray(int arr[], int size)

{

cout << "inside showArray()" << endl; //Simkin temp junk code so it will compile

}

/* proof

The contents of the original array are:

1 2 3 4 5

The contents of the original array are:

1 2 3 4 5

The contents of the new array are:

0 1 2 3 4 5

*/

Answer 1

Answer :- The C code can be written as-

#include <iostream>

using namespace std;

int * shift(int arr[], int size); /* prototype of the shift function */

void showArray(int arr[], int size); /* prototype of the showArray function */

int main()

{

    int numbers[5], *new_arr;

    cout << "Enter 5 numbers: ";

    // Storing 5 number entered by user in an array

    for (int i = 0; i < 5; ++i)

    {

        cin >> numbers[i];

    }

    //showArray(numbers, 5);

    new_arr = shift(numbers, 5);

    cout<<"The new array content is-"<<endl;

    showArray(new_arr, 6);

    return 0;

}

int * shift(int arr1[], int size) /* definition of the shift function */

{

    int *arr2;

    arr2 = (int*) malloc((size+1)*sizeof(int));

    arr2[0] = 0;

    for(int i = 1; i < (size+1); i++){

        arr2[i] = arr1[i-1];

    }

    return arr2;

}

void showArray(int arr[], int size)

{

    for(int i=0; i<size;i++){

        cout<<" "<<arr[i];

    }

}

OUTPUT :-

Enter 5 numbers: 1
12
13
14
15
The new array content is-
0 1 12 13 14 15