1. Implement and grow a dynamic array using pointer arithmetic. a) Use the provided main function (see below). b) Implement a populate function which stores values from 0 to size into the array p using pointer arithmetic to access array locations. c) Implement a print function which prints the values of the array p using pointer arithmetic. d) Implement a printMemory function which prints the memory addresses of all elements in array p using pointer arithmetic. e) Implement a grow function which resizes the existing array from the initial size to new size using pointer arithmetic. f) Verify via the output that the new array is a distinct memory space from the original array. Main Output Example int main( ) { Enter a size: 3 cout <« endl; Original: 0 1 2 int size, newSize; cout « "Enter a size: "; 0x7fc2ald@0000 cin >> size; 0x7fc2ald00004 cout <« endl; 0x7fc2ald00008 int *p = new int[size](); cout « "Original: " « endl; populate(p, size); print(p, size); printMemory(p, size); cout « endl; Enter a new size: 5 Inside gr ow: 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale00004 Ox7fc2ale00008 cout <« "Enter a new size: "; cin >> newSize; cout <« endl; 0x7fc2ale0000c 0x7fc2ale00010 p = grow(p, size, newSize); cout <« "After grow: " « endl; print(p, newSize); printMemory(p, newSize); After grow: 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale00004 0x7fc2ale@0008 cout <« endl; 0x7fc2ale0000c return 0; 0x7fc2ale00010
1. Implement and grow a dynamic array using pointer arithmetic. a) Use the provided main function (see below). b) Implement a populate function which stores values from 0 to size into the array p using pointer arithmetic to access array locations. c) Implement a print function which prints the values of the array p using pointer arithmetic. d) Implement a printMemory function which prints the memory addresses of all elements in array p using pointer arithmetic. e) Implement a grow function which resizes the existing array from the initial size to new size using pointer arithmetic. f) Verify via the output that the new array is a distinct memory space from the original array. Main Output Example int main( ) { Enter a size: 3 cout <« endl; Original: 0 1 2 int size, newSize; cout « "Enter a size: "; 0x7fc2ald@0000 cin >> size; 0x7fc2ald00004 cout <« endl; 0x7fc2ald00008 int *p = new int[size](); cout « "Original: " « endl; populate(p, size); print(p, size); printMemory(p, size); cout « endl; Enter a new size: 5 Inside gr ow: 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale00004 Ox7fc2ale00008 cout <« "Enter a new size: "; cin >> newSize; cout <« endl; 0x7fc2ale0000c 0x7fc2ale00010 p = grow(p, size, newSize); cout <« "After grow: " « endl; print(p, newSize); printMemory(p, newSize); After grow: 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale00004 0x7fc2ale@0008 cout <« endl; 0x7fc2ale0000c return 0; 0x7fc2ale00010
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter10: Pointers
Section: Chapter Questions
Problem 4PP
Related questions
Question
I'm stuck on this question and I don't know how I should be approaching this. What should I do?
![1. Implement and grow a dynamic array using pointer arithmetic.
a) Use the provided main function (see below).
b) Implement a populate function which stores values from 0 to size
into the array p using pointer arithmetic to access array locations.
c) Implement a print function which prints the values of the array
p using pointer arithmetic.
d) Implement a printMemory function which prints the memory addresses
of all elements in array p using pointer arithmetic.
e) Implement a grow function which resizes the existing array from
the initial size to
new size using pointer arithmetic.
f) Verify via the output that the new array is a distinct memory space
from the original array.
Main
Output Example
int main( ) {
Enter a size: 3
cout <« endl;
Original:
0 1 2
int size, newSize;
cout « "Enter a size: ";
0x7fc2ald@0000
cin >> size;
0x7fc2ald00004
cout <« endl;
0x7fc2ald00008
int *p = new int[size]();
cout « "Original: " « endl;
populate(p, size);
print(p, size);
printMemory(p, size);
cout « endl;
Enter a new size: 5
Inside gr ow:
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale00004
Ox7fc2ale00008
cout <« "Enter a new size: ";
cin >> newSize;
cout <« endl;
0x7fc2ale0000c
0x7fc2ale00010
p = grow(p, size, newSize);
cout <« "After grow: " « endl;
print(p, newSize);
printMemory(p, newSize);
After grow:
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale00004
0x7fc2ale@0008
cout <« endl;
0x7fc2ale0000c
return 0;
0x7fc2ale00010](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F613158f8-f57a-4aaf-bb0a-53a23f872da5%2Fd384ea25-00f0-4649-9627-c2d36b5e7b55%2Fkqx86v4.png&w=3840&q=75)
Transcribed Image Text:1. Implement and grow a dynamic array using pointer arithmetic.
a) Use the provided main function (see below).
b) Implement a populate function which stores values from 0 to size
into the array p using pointer arithmetic to access array locations.
c) Implement a print function which prints the values of the array
p using pointer arithmetic.
d) Implement a printMemory function which prints the memory addresses
of all elements in array p using pointer arithmetic.
e) Implement a grow function which resizes the existing array from
the initial size to
new size using pointer arithmetic.
f) Verify via the output that the new array is a distinct memory space
from the original array.
Main
Output Example
int main( ) {
Enter a size: 3
cout <« endl;
Original:
0 1 2
int size, newSize;
cout « "Enter a size: ";
0x7fc2ald@0000
cin >> size;
0x7fc2ald00004
cout <« endl;
0x7fc2ald00008
int *p = new int[size]();
cout « "Original: " « endl;
populate(p, size);
print(p, size);
printMemory(p, size);
cout « endl;
Enter a new size: 5
Inside gr ow:
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale00004
Ox7fc2ale00008
cout <« "Enter a new size: ";
cin >> newSize;
cout <« endl;
0x7fc2ale0000c
0x7fc2ale00010
p = grow(p, size, newSize);
cout <« "After grow: " « endl;
print(p, newSize);
printMemory(p, newSize);
After grow:
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale00004
0x7fc2ale@0008
cout <« endl;
0x7fc2ale0000c
return 0;
0x7fc2ale00010
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning