Question

c++ code

In mythology, the Hydra was a monster with many heads. Every time the hero chopped off a head, two smaller heads would grow in its place. Fortunately for the hero, If the head was small enough, he could chop it off without two more growing in its place. To kill the Hydra, all the hero needed to do was to chop off all the heads. Write a program that simulates the Hydra. Instead of heads, we will use strings. A container of strings, then, represents the Hydra. You can use any ADT we've learned to represent the container (Bog, List etc.). The book recommends Bag but that's not the only option. Irecommend using the Linked implementation of whatever ADT you choose though since you don't know the length you will need for the container. Every time you remove a string from the list, delete the first letter of the string and put two copies of the remaining string back into the list. For example, if you remove HYDRA, you add two copies of YDRA to the list. If you remove a one- letter word, you add nothing to the list. Exactly where in the list you add or remove strings is up to you. For example, you might always add to the end of the list, or you might add at random positions. To begin, read a word from the keyboard and place it into an empty list. The rule is only one string can be removed at a time. You can let the user choose which string to remove or you can have the program choose. Remember once a string is removed two strings must be added to your container that are a copies of the string removed with the first letter removed. The Hydra dies when the list has no more strings for you to remove Using Big O notation, predict the time requirement for this algorithm in terms of the number n of characters in the initial string. State what computation unt you used for your Big O analysis Try some benchmark analysis on various strings of size n to see if your Big O is correct. Look at my programs in Chapter 11 where I counted comparisons or Compare your results when you use the following strategies for removing a string from the list 1. Always remove the shortest string. 2. Always remove the longest string. In mythology, the Hydra was a monster with many heads. Every time the hero chopped off a head, two smaller heads would grow in its place. Fortunately for the hero, If the head was small enough, he could chop it off without two more growing in its place. To kill the Hydra, all the hero needed to do was to chop off all the heads. Write a program that simulates the Hydra. Instead of heads, we will use strings. A container of strings, then, represents the Hydra. You can use any ADT we've learned to represent the container (Bog, List etc.). The book recommends Bag but that's not the only option. Irecommend using the Linked implementation of whatever ADT you choose though since you don't know the length you will need for the container. Every time you remove a string from the list, delete the first letter of the string and put two copies of the remaining string back into the list. For example, if you remove HYDRA, you add two copies of YDRA to the list. If you remove a one- letter word, you add nothing to the list. Exactly where in the list you add or remove strings is up to you. For example, you might always add to the end of the list, or you might add at random positions. To begin, read a word from the keyboard and place it into an empty list. The rule is only one string can be removed at a time. You can let the user choose which string to remove or you can have the program choose. Remember once a string is removed two strings must be added to your container that are a copies of the string removed with the first letter removed. The Hydra dies when the list has no more strings for you to remove Using Big O notation, predict the time requirement for this algorithm in terms of the number n of characters in the initial string. State what computation unt you used for your Big O analysis Try some benchmark analysis on various strings of size n to see if your Big O is correct. Look at my programs in Chapter 11 where I counted comparisons or Compare your results when you use the following strategies for removing a string from the list 1. Always remove the shortest string. 2. Always remove the longest string. In mythology, the Hydra was a monster with many heads. Every time the hero chopped off a head, two smaller heads would grow in its place. Fortunately for the hero, if the head was small enough, he could chop it off without two more growing in its place. To kill the Hydra, the hero needed to do was to chop off all the heads. Write a program that simulates the Hydra. Instead of heads, we will use strings. A container of strings, then, represents the Hydra. You can use any ADT we've learned to represent the container (Bag. List etc.). The book recommends Bag but that's not the only option. I recommend using the Linked implementation of whatever ADT you choose though since you don't know the length you will need for the container Every time you remove a string from the list, delete the first letter of the string and put two copies of the remaining string back into the list. For example, if you remove HYDRA, you add two copies of YDRA to the list. If you remove a one- letter word, you add nothing to the list. Exactly where in the list you add or remove strings is up to you. For example, you might always add to the end of the list, or you might add at random positions. To begin, read a word from the keyboard and place it into an empty list. The rule is only one string can be removed at a time. You can let the user choose which string to remove or you can have the choose. Remember once a string is removed two strings must be added to your container that are a copies of the string removed with the first letter removed. The Hydra dies when the list has no more strings for you to remove. program Using Big O notation, predict the time requirement for this algorithm in terms of the number n of characters in the initial string. State what computation unit you used for your Big O analysis. Try some benchmark analysis on various strings of size n to see if your Big O is correct. Look at my programs in Chapter 11 where I counted comparisons or assignments. Compare your results when you use the following strategies for removing a string from the list: 1. Always remove the shortest string. 2. Always remove the longest string.

Answer 1

Note that I will be using vector as a container which is a dynamic array in C++ that is it's size is increased automatically as required I will be removing 1st string at every step

Below is the C++ code I hope that i have provided sufficient comments for your better understanding Note that I have done proper indentation but this code is automatically left alligned on this interface

#include<bits/stdc++.h>
using namespace std;
void print(vector <string>v)
{
    for(int i=0;i<v.size();i++)
        cout<<v[i]<<" ";
    cout<<endl;
}
int main()
{
    vector <string>v;
    string s;
    int i, j;
    cout<<"Enter any string: ";
    cin>>s;
    v.push_back(s);
    print(v);   //Display contents of the container
    while(!v.empty())   //loop till container is empty
    {
        s = v[0];   //Always replace 1st string
        v.erase(v.begin()); //remove 1st string
        if(s.length()>1)    //check whether the string is of length greater than 1
        {
            s = s.substr(1);
            v.push_back(s);
            v.push_back(s);
        }
        print(v);   //Display contents of the container
    }
}

Below is the screenshot of output

"CAUsers Prakher 1Documentslcltest.exe" Enter any string: Hydra Hydra ydra ydra ydra dra dra dra dra dra dra dra dra dra ra ra dra drara ra ra ra dra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra ra a a ra ra ra ra ra ra a a a a ra ra ra ra ra a a a a a a ra ra ra ra a a a a a a a a ra ra ra a a a a a a a a a a ra ra a a a a a a a a a a a a Process returned 0 (8x0) execution time : 3.493 s Press any key to continue.

I have tried to explain it in very simple language and I hope that i have answered your question satisfactorily.Leave doubts in comment section if any.