C++
", 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 "/>
Extracted 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
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=""> 4 #include 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