Write in C++Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array.NoteThe same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert.If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged.Assume all inputs are lowercase alphabets.Function specificationsName: secondPlace()Parameters (Your function should accept these parameters IN THIS ORDER):input_strings string: The array containing stringsstring_to_insert string: the string to insertstring_to_find string: the string to find (target string)num_elements int: The number of elements that are currently stored in the arrayarr_size int: The number of elements that can be stored in the arraycount int: The number of the target strings present in the arrayReturn Value: int:The number of elements in the array after the new strings are inserted into the arrayThe original number of elements in the array if the new pokemon cannot be inserted into the array Sample run 1: Function Callint size = 5;string input_strings [size]int num_elements = 3;int count = 1;string string_to_insert = "charizard";string string_to_find = "meowth";// updating num_elements with the updated value returned by secondPlacenum_elements = secondPlace (input_strings, string_to_insert, string_to_find, num_elements, size, count);// print num_elementscout << "Function returned value: " << num_elements << endl;// print array contentsfor(int i = 0; i < size; i++){}=Output{"clefairy", "meowth", "snorlax"};cout < Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for aPokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts anew Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function fromthe previous sub-question to add the new Pokemon. The function should return the new number of strings in the array.Note• The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of thePokemon he is searching for to be followed by the Pokemon he is attempting to insert.• If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceedsthe total size of the array, the array should remain unchanged.• Assume all inputs are lowercase alphabets.Function specifications• Name: secondPlace()• Parameters (Your function should accept these parameters IN THIS ORDER):input_strings string: The array containing stringsstring_to_insert string the string to insertstring_to_find string the string to find (target string)o num_elements int: The number of elements that are currently stored in the arrayo arr_size int: The number of elements that can be stored in the arrayo count int: The number of the target strings present in the arrayOOO• Return Value: int :• The number of elements in the array after the new strings are inserted into the array• The original number of elements in the array if the new pokemon cannot be inserted into the array

code:- #include <iostream>#include <string>using namespace std; int insertAfter(string…

Answered: Sample run 1: Function Call int size =…

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

Related questions

Question

Write in C++

Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array.

Note

The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert.
If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged.
Assume all inputs are lowercase alphabets.

Function specifications

Name: secondPlace()
Parameters (Your function should accept these parameters IN THIS ORDER):
- input_strings string: The array containing strings
- string_to_insert string: the string to insert
- string_to_find string: the string to find (target string)
- num_elements int: The number of elements that are currently stored in the array
- arr_size int: The number of elements that can be stored in the array
- count int: The number of the target strings present in the array
Return Value: int:
- The number of elements in the array after the new strings are inserted into the array
- The original number of elements in the array if the new pokemon cannot be inserted into the array

Sample run 1: Function Call
int size = 5;
string input_strings [size]
int num_elements = 3;
int count = 1;
string string_to_insert = "charizard";
string string_to_find = "meowth";
// updating num_elements with the updated value returned by secondPlace
num_elements = secondPlace (input_strings, string_to_insert, string_to_find, num_elements, size, count);
// print num_elements
cout << "Function returned value: " << num_elements << endl;
// print array contents
for(int i = 0; i < size; i++)
{
}
=
Output
{"clefairy", "meowth", "snorlax"};
cout <<input_strings[i] << endl;
Function returned value: 4
clefairy
meowth
charizard
snorlax
Q₁

Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a
Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a
new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from
the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array.
Note
• The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the
Pokemon he is searching for to be followed by the Pokemon he is attempting to insert.
• If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds
the total size of the array, the array should remain unchanged.
• Assume all inputs are lowercase alphabets.
Function specifications
• Name: secondPlace()
• Parameters (Your function should accept these parameters IN THIS ORDER):
input_strings string: The array containing strings
string_to_insert string the string to insert
string_to_find string the string to find (target string)
o num_elements int: The number of elements that are currently stored in the array
o arr_size int: The number of elements that can be stored in the array
o count int: The number of the target strings present in the array
O
O
O
• Return Value: int :
• The number of elements in the array after the new strings are inserted into the array
• The original number of elements in the array if the new pokemon cannot be inserted into the array

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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.