Tasks: Follow the directions below to complete your lab assignment
For today's lab we will be completing Exercise E13.12 from the book. Starter code is included on
Google Drive - SubstringTester.java and SubstringGenerator.java.
E13.12 - Implement a SubstringGenerator (class) that generates all substrings of a string
recursively. For example, the substrings of the string "rum" are the seven strings
"rum", "ru", "r", "um", "u", "m", ""
Hint: First enumerate all substrings that start with the first character. There are n of them if the string
has length n. Then enumerate the substrings of the string that you obtain by removing the first
character.
Here is what your output should look like after your project is completed. (The order of your
substrings is not important, if your generator produces all substrings correctly).
Substrings of "ab"
Actual:
Expected:
'b' 'a' 'ab'
'b' 'a' 'ab'
Substrings of "abc"
Actual:
'c' 'b' 'bc' 'a' 'ab' 'abc'
Expected:
'c' 'b' 'bc' 'a' 'ab' 'abc'
Substrings of "abc123"
Actual:
'3' '2' '23' '1' '12' '123' 'c' 'c1' 'c12' 'c123' 'b'
'bc' 'bc1' 'bc12' 'bc123' 'a' 'ab' 'abc' 'abcl' 'abc12' 'abc123'
Expected:
'3' '2' '23' '1' '12' '123' 'c' 'c1' 'c12' 'c123' 'b'
'bc' 'bc1' 'bc12' 'bc123' 'a' 'ab' 'abc' 'abcl' 'abc12' 'abc123'
