Continue the preceding problem, now finding the smallest base string whose repetition forms a given nonempty string. For example, when given the string "hahahah find "ha". Make use of the function, is_repetition_of(str, base),from the preceding exercise which is declared in util.h. Write a recursive helper function that tries the given string and base, and if that doesn't work, tries again after moving the first character from the string to the base. Note that the repetition_base function should return the entire string if it isn't a repetition of a shorter prefix-after all, any string is a one-time repetition of itself. strings.cpp #include using namespace std; 3 1 2 #include "util.h" 4 5 string repetition_base_helper(string str, string base) { if (is_repetition_of(str, base)) ... 7 8 9 } 10 11 string repetition_base(string str) 12 {
Continue the preceding problem, now finding the smallest base string whose repetition forms a given nonempty string. For example, when given the string "hahahah find "ha". Make use of the function, is_repetition_of(str, base),from the preceding exercise which is declared in util.h. Write a recursive helper function that tries the given string and base, and if that doesn't work, tries again after moving the first character from the string to the base. Note that the repetition_base function should return the entire string if it isn't a repetition of a shorter prefix-after all, any string is a one-time repetition of itself. strings.cpp #include using namespace std; 3 1 2 #include "util.h" 4 5 string repetition_base_helper(string str, string base) { if (is_repetition_of(str, base)) ... 7 8 9 } 10 11 string repetition_base(string str) 12 {
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Hi, I got stuck with this problem. The problem I got when I compile is the word "mississippi"
Transcribed Image Text:Continue the preceding problem, now finding the smallest base string whose repetition forms a given nonempty string. For example, when given the string "hahahaha",
find "ha". Make use of the function, is_repetition_of(str, base), from the preceding exercise which is declared in util.h.
Write a recursive helper function that tries the given string and base, and if that doesn't work, tries again after moving the first character from the string to the base.
Note that the repetition_base function should return the entire string if it isn't a repetition of a shorter prefix- after all, any string is a one-time repetition of itself.
strings.cpp
#include <string>
using namespace std;
#include "util.h"
1
2
3
4
string repetition_base_helper(string str, string base)
{
5
7
if (is_repetition_of(str, base))..
8
}
10
11
string repetition_base(string str)
{
return repetition_base_helper(str.substr(1), str.substr(0, 1));
}
12
13
14
Transcribed Image Text:Continue the preceding problem, now finding the smallest base string whose repetition forms a given nonempty string. For example, when given the string "hahahaha",
find "ha". Make use of the function, is_repetition_of(str, base), from the preceding exercise which is declared in util.h.
Write a recursive helper function that tries the given string and base, and if that doesn't work, tries again after moving the first character from the string to the base.
Note that the repetition_base function should return the entire string if it isn't a repetition of a shorter prefix- after all, any string is a one-time repetition of itself.
strings.cpp
#include <string>
using namespace std;
#include "util.h"
1
2
3
4
string repetition_base_helper(string str, string base)
{
5
7
if (is_repetition_of(str, base))..
8
}
10
11
string repetition_base(string str)
{
return repetition_base_helper(str.substr(1), str.substr(0, 1));
}
12
13
14
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY