Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write the resize function for the dynamic, partially-filled array below. Follow the comments to complete the function. dynamic.cpp 1 #include 2 #include 3 #include "debug_new.h" 4 #include "array.h" 5 using namespace std; 7 /** 8. Resize a dynamic chunk of memory. @param arg a pointer to the beginning of the array @param size the current allocated size @return a pointer to an initialized 2x chunk. 10 11 12 */ 13 int* resize(int* a, int size) 14 { 15 // Allocate a new array twice the size of the original 16 // Copy the original elements into the new array 17 |/ Free original array 18 |/ Return new array 19 } 20 21 int main(int argc, char* argv[]) 22 { 23 int size = 0; int capacity = 2; // initial capacity is 2 int *a = new int[capacity]; 24 25 26 27 cout « "Enter positive numbers (negative to quit): "; int n; cin >> n; while (n >= 0) 28 29 30

Write the resize function for the dynamic, partially-filled array below. Follow the comments to complete the function. dynamic.cpp 1 #include 2 #include 3 #include "debug_new.h" 4 #include "array.h" 5 using namespace std; 7 /** 8. Resize a dynamic chunk of memory. @param arg a pointer to the beginning of the array @param size the current allocated size @return a pointer to an initialized 2x chunk. 10 11 12 */ 13 int* resize(int* a, int size) 14 { 15 // Allocate a new array twice the size of the original 16 // Copy the original elements into the new array 17 |/ Free original array 18 |/ Return new array 19 } 20 21 int main(int argc, char* argv[]) 22 { 23 int size = 0; int capacity = 2; // initial capacity is 2 int *a = new int[capacity]; 24 25 26 27 cout « "Enter positive numbers (negative to quit): "; int n; cin >> n; while (n >= 0) 28 29 30

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

fill in code under the comments, in C++

Write the resize function for the dynamic, partially-filled array below. Follow the comments to complete the function. dynamic.cpp 1 #include <iostream> 2 #include <string> 3 #include "debug_new.h" #include "array.h" using namespace std; 6 4 7 /** Resize a dynamic chunk of memory. @param arg a pointer to the beginning of the array @param size the current allocated size @return a pointer to an initialized 2x chunk. */ 8. 9 10 11 12 13 int* resize(int* a, int size) { // Allocate a new array twice the size of the original // Copy the original elements into the new array // Free original array // Return new array 14 15 16 17 18 19 } 20 21 int main(int argc, char* argv[]) 22 { 23 int size = 0; int capacity = 2; // initial capacity is 2 int *a = new int[capacity]; 24 25 26 27 cout « "Enter positive numbers (negative to quit): "; int n; cin >> n; while (n >= 0) 28 29 30
Transcribed Image Text:Write the resize function for the dynamic, partially-filled array below. Follow the comments to complete the function. dynamic.cpp 1 #include <iostream> 2 #include <string> 3 #include "debug_new.h" #include "array.h" using namespace std; 6 4 7 /** Resize a dynamic chunk of memory. @param arg a pointer to the beginning of the array @param size the current allocated size @return a pointer to an initialized 2x chunk. */ 8. 9 10 11 12 13 int* resize(int* a, int size) { // Allocate a new array twice the size of the original // Copy the original elements into the new array // Free original array // Return new array 14 15 16 17 18 19 } 20 21 int main(int argc, char* argv[]) 22 { 23 int size = 0; int capacity = 2; // initial capacity is 2 int *a = new int[capacity]; 24 25 26 27 cout « "Enter positive numbers (negative to quit): "; int n; cin >> n; while (n >= 0) 28 29 30
29 while (n >= 0) { if (size == { a = resize(a, size); // Write this function capacity *= 2; } a[size] = n; cin >> n; size++; 30 31 32 сараcity) 33 34 35 36 37 38 39 40 print ("a->", a, size); delete[] a; 41 42 43 }
Transcribed Image Text:29 while (n >= 0) { if (size == { a = resize(a, size); // Write this function capacity *= 2; } a[size] = n; cin >> n; size++; 30 31 32 сараcity) 33 34 35 36 37 38 39 40 print ("a->", a, size); delete[] a; 41 42 43 }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
ADT and Class
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
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS