Question

Java question: Create a class called ​Composition​. Read in all of the words in a file called dictionary.txt​. Each word will be separated by whitespace (i.e. a space, a tab or a newline character). You must read in all words and determine if a word can be created by concatenating two other words. For example, the word racecar can be created by concatenating race and car. All such possibilities must be output to a file in this format: racecar: race car
In other words, you output the original word followed by a colon, followed by the first word, followed by a space and finally the second word. Each answer is on 1 line. All of these possibilities are output to a file called​ composed.txt​.All of the original words must be in alphabetical order. In other words,​racecar: race car shows up in the output after ​another:an other​.

Answer 1

The source code is given below:

/**
* Composition.java
*/
import java.io.*;
class Composition
{   
public static String w1="";// to store word1 of composed word
public static String w2="";// to store word2 of composed word
/* method to check if the word w is a composed word in word list words[]*/
public static boolean isComposed(String w,String words[])
{ int len=words.length;// length of word list
   for(int i=0;i<len-1;i++)
       {
           for(int j=i+1;j<len;j++)
           {
               if((words[i]+words[j]).compareTo(w)==0) // if composed word is w
               { w1=words[i]; // word1
               w2=words[j]; // word2  
               return true;  
               }
           }
       }
       return false; //in case no composed word is w
}
/* sorts word list according to bubble sort algorithm*/
   public static void sort(String words[])
   {
       int len=words.length;
       for(int i=0;i<len-1;i++)
       {
           for(int j=0;j<len-1-i;j++)
           {
               if(words[j].compareTo(words[j+1])>0)// if words[j] is alphabetically found after words[j+1]
               { /* swapping between words[j] and words[j+1] */
                   String temp=words[j];
                   words[j]=words[j+1];
                   words[j+1]=temp;
               }
           }
       }
   }
/* main() throws IOException because it uses file i/o operation */
   public static void main(String args[]) throws IOException
   {
       FileReader fr=new FileReader("dictionary.txt"); // input file dictionary.txt
       FileWriter fw=new FileWriter("composed.txt"); // output file composed.txt
       BufferedReader br=new BufferedReader(fr); // BufferedReader object
       BufferedWriter bw=new BufferedWriter(fw); // BufferedWriter object
       String word="",w;
       while((w=br.readLine())!=null)// reads linewise from input file
       { word=word+w+"\n"; //concatenates words with \n as separator
       }
       br.close();// closes input file
       String words[]=word.split("\n"); // splits word list at \n to create array of strings
sort(words); // sorts array of strings words
  

for(int i=0;i<words.length;i++)// loops till all the words finished
       { if(isComposed(words[i],words)) // checks a word for composed word or not
       bw.write(words[i]+":"+w1+" "+w2+"\n"); //writes the composed word to output file composed.txt
       }
   bw.close(); //closes output file
   }
}

/***************************/

The source code screen shot is given below:

The input file dictionary.txt contains following data:

some
rattle
ball
lifetime
back
ward
elsewhere
upside
grandmother
times
cannot
baseball
fireworks
passport
together
become
life
time
became
sunflower
crosswalk
pass
snake
port
basketball
sweetmeat
superstructure
moonlight
football
railroad
rattlesnake
anybody
weatherman
throwback
skateboard
meantime
foot
earthquake
everything
herein
can
not
sometimes
also
backward
schoolhouse
butterflies

The output file composed.txt contains the following data:

backward:back ward
cannot:can not
lifetime:life time
passport:pass port
rattlesnake:rattle snake
sometimes:some times

Output file screen shot is given below: