Jun-13-2018, 10:10 PM
Yes, part of the exercise is that I have to use recursion. I left the first part of the code out- the first part of the code adds "." to any word that doesn't have a length that is a power of 2 to make it a power of 2 (ie. a word that is 12 characters long would be changed to one that is 16 characters long). I left this part of the description and code out to simplify my question but some of the words I tested are much longer than 8 characters and it seems to work.