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
icon
Related questions
Question

C++

Write the function insert which reads numbers from standard input, inserting the numbers in order
into the partially-filled array a.
arrays.cpp
1
#include <iostream>
2
using namespace std;
3
size_t insert(int a[], size_t size, size_t capacity)
{
int n;
4
5
while (size < capacity && cin » n)
{
7
8
9.
10
11
}
return size;
}
12
13
14
Demo.cpp
//IN 9 17 12 24 11 14 19 2 1 11 11 10 7 15 18 23 10 3 8 24 15 21 20 13 24\n
//IN -2 0 1 -9 -5 -8 6 -7 3 1 7 0 -7 -7 8 2 4 5 -7 1 -7 0 10 7 2\n
1
2
3
#include <iostream>
4
#include <string>
5
using namespace std;
7
#include "arrays.h"
9
int main()
{
int a[100] = {};
print("before->", a, 0);
size t size = insert(a, 0, 3);
print("after insert(a, 0, 3)->", a, size);
10
11
12
13
14
15
print("\nbefore->", a, size);
size = insert(a, size, 8);
print("after insert(a, size, 8)->", a, size);
16
17
18
19
print("\nbefore->", a, size);
size = insert (a, 0, 4);
print("after insert(a, 0, 4)->", a, size);
20
21
22
23 }
CodeCheck
Reset
Transcribed Image Text:Write the function insert which reads numbers from standard input, inserting the numbers in order into the partially-filled array a. arrays.cpp 1 #include <iostream> 2 using namespace std; 3 size_t insert(int a[], size_t size, size_t capacity) { int n; 4 5 while (size < capacity && cin » n) { 7 8 9. 10 11 } return size; } 12 13 14 Demo.cpp //IN 9 17 12 24 11 14 19 2 1 11 11 10 7 15 18 23 10 3 8 24 15 21 20 13 24\n //IN -2 0 1 -9 -5 -8 6 -7 3 1 7 0 -7 -7 8 2 4 5 -7 1 -7 0 10 7 2\n 1 2 3 #include <iostream> 4 #include <string> 5 using namespace std; 7 #include "arrays.h" 9 int main() { int a[100] = {}; print("before->", a, 0); size t size = insert(a, 0, 3); print("after insert(a, 0, 3)->", a, size); 10 11 12 13 14 15 print("\nbefore->", a, size); size = insert(a, size, 8); print("after insert(a, size, 8)->", a, size); 16 17 18 19 print("\nbefore->", a, size); size = insert (a, 0, 4); print("after insert(a, 0, 4)->", a, size); 20 21 22 23 } CodeCheck Reset
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Function Arguments
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