Wordsplit printer material from lecture 09 will be helpful here. in

  WordSplitPrinter,  

WordSplit Printer Material from Lecture  09 will be helpful here. In lecture, we talked about how we can use  recursion exploration to print out all permutations of a given string.  For example, we could use recursion on the input “goat” to print out:  tgoa tgao toga goat gota gaot gato gtoa gtao ogat ogta oagt oatg otga  otag agot agto aogt aotg atgo atog toag tago taog Most of these aren’t  actual anagrams, because they’re gibberish. We could check which are  actual words (like “toga”), but that wouldn’t be enough. There are also  cases like “atgo” where the full string isn’t a word, but we can break  it into the separate words “at” and “go”. To find all anagrams, then, we  need to find the ways we can take one of these permutations and split  it into separate English words. That’s where your method,  findWordsplits, comes in: public void findWordSplits(String input,  TreeSet<String> allWords) { // TODO: Implement this. }   The method takes two parameters: input and allWords. input will be a  string like “atgo” or “goat” that you’re trying to split into separate  words. You do not need to find permutations of input, since that was  part of the demo we did in class. input will be a string whose character  ordering is already set. allWords is a set containing the words listed  in the “words.txt” file — nearly 10,000 English words. allWords is  already populated for you! You’ll need to use it when you’re splitting  up the input string, since each chunk needs to be an actual word. . Your  task is to implement findWordsSplits to find every way you can split  input into valid English words, where every character in input is used  exactly once. For example, if input is we would expect these two splits  to be printed: “goat”, go at goat Other arrangements, such as “g oat” or  “goat”, would not be printed because “g”, “goa”, and “t” are not  considered words. The main method uses “isawabus” as input. Once  findWordsSplits is correctly implemented, you should see the following  output: i saw a bus i saw ab us is aw a bus is aw ab us If the exact  ordering is not the same, that’s completely fine. I’ve provided an  already implemented method in the starter code called printWordsplit:  public void printWordSplit(ArrayList<String> words) { // Already  implemented for you. } You should call printWordSplit to print out a  single arrangement. For the “i saw a bus” example above, you would call  printWordSplit passing in an ArrayList<String> containing [“i”,  “saw”, “a”, “bus” ] to print it out. findWordSplits is a recursion  exploration problem, just like our permutations demo in lecture. Think  about how to apply the recursion exploration formula:   1. How do you represent a path of options you’re exploring? o  printWordsplit is a major hint — if you need an ArrayList<String>  to print a word split, that would also be a convenient way to represent  a path. 2. At each step, what are your options? o Consider an example  like “isawabus”. We can actually list out every possible option for the  next word: i is isa isaw isawa isawab isawabu isawabus Not all of these  are words, so you’ll need to check for yourself which ones are valid  options using the allWords set. The TreeSet<String> is just a  specific type of Set, so you can use any Set methods on it. 3. What do  you do when you’ve finished exploring a path? o Just call  printWordsplit! Another hint: in your implementation, you will need to  use the String’s substring method to split a string into two parts. • To  get a substring that contains the first i characters, use  str.substring(0, i) where str is the name of your String variable. To  get the rest of that string (i.e. everything other than the first i  characters), use str.substring(i). If you’re struggling to translate the  above into actual code, I strongly recommend revisiting Lecture 09 and  see how we applied the same formula to the permutations problem or the  password guessing problem. WordSplitChecker Material from Lecture 10  will be helpful here. If you were able to complete WordSplitPrinter,  then congratulations! You’ve already done most of the hard work for this  last step. In WordSplitChecker 

WordSplitPrinter.java

package edu.csc220.recursion;

import java.io.*;
import java.util.*;

public class WordSplitPrinter {
   /**
    * Finds and prints out every possible way to split the input String into individual, valid English words (including
    * if input is itself a single valid word). You must call printWordSplit below to actually print out the results.
    */
   public void findWordSplits(String input, TreeSet<String> allWords) {
       // TODO: Implement this.
   }

   /** Prints out a word split, i.e. one particular arrangement of words. This is implemented for you! */
   private void printWordSplit(ArrayList<String> words) {
       if (words.isEmpty()) {
           System.out.println("(empty word list)");
       } else {
           System.out.print(words.get(0));
           for (int i = 1; i < words.size(); i++) {
               System.out.print(" " + words.get(i));
           }
           System.out.println();
       }
   }

   public static void main(String[] args) {
       TreeSet<String> dictionary = readWords();
       WordSplitPrinter wordSplitPrinter = new WordSplitPrinter();

       // Expected to print out:
       // i saw a bus
       // i saw ab us
       // is aw a bus
       // is aw ab us
       wordSplitPrinter.findWordSplits("isawabus", dictionary);
   }

   // Reads the "words.txt" file and returns the words in a TreeSet<String>. This is completely implemented for you!
   private static TreeSet<String> readWords() {
       TreeSet<String> allWords = new TreeSet<>();
       try {
           BufferedReader bufferedReader = new BufferedReader(new FileReader("words.txt"));
           String line;
           while ((line = bufferedReader.readLine()) != null) {
               if (line.trim().isEmpty()) {
                   continue;
               }
               allWords.add(line.toLowerCase());
           }
           bufferedReader.close();
       } catch (IOException exception) {
           throw new RuntimeException(exception);
       }
       return allWords;
   }
}

Calculate the price of your order

Select your paper details and see how much our professional writing services will cost.

We`ll send you the first draft for approval by at
Price: $36
  • Freebies
  • Format
  • Formatting (MLA, APA, Chicago, custom, etc.)
  • Title page & bibliography
  • 24/7 customer support
  • Amendments to your paper when they are needed
  • Chat with your writer
  • 275 word/double-spaced page
  • 12 point Arial/Times New Roman
  • Double, single, and custom spacing
  • We care about originality

    Our custom human-written papers from top essay writers are always free from plagiarism.

  • We protect your privacy

    Your data and payment info stay secured every time you get our help from an essay writer.

  • You control your money

    Your money is safe with us. If your plans change, you can get it sent back to your card.

How it works

  1. 1
    You give us the details
    Complete a brief order form to tell us what kind of paper you need.
  2. 2
    We find you a top writer
    One of the best experts in your discipline starts working on your essay.
  3. 3
    You get the paper done
    Enjoy writing that meets your demands and high academic standards!

Samples from our advanced writers

Check out some essay pieces from our best essay writers before your place an order. They will help you better understand what our service can do for you.

Get your own paper from top experts

Order now

Perks of our essay writing service

We offer more than just hand-crafted papers customized for you. Here are more of our greatest perks.

  • Swift delivery
    Our writing service can deliver your short and urgent papers in just 4 hours!
  • Professional touch
    We find you a pro writer who knows all the ins and outs of your subject.
  • Easy order placing/tracking
    Create a new order and check on its progress at any time in your dashboard.
  • Help with any kind of paper
    Need a PhD thesis, research project, or a two-page essay? For you, we can do it all.
  • Experts in 80+ subjects
    Our pro writers can help you with anything, from nursing to business studies.
  • Calculations and code
    We also do math, write code, and solve problems in 30+ STEM disciplines.

Frequently asked questions

Get instant answers to the questions that students ask most often.

See full FAQ
    See full FAQ

    Take your studies to the next level with our experienced specialists

    Chat
    Hello, we are online 24/7. Leave a message we will reply instantly