Question

java code.

James needs to create a computer text based game where some user has to enter as many words with the given letters as the given word.

A good start would be writing a method that checks if a method has the same letters as the other.

include pseudo code+

Input-Listen and Silent have the same word

that's all information I have

is a Anagram program that need to be done.ASAP

just help me with the pseudo code of the program. not the actul program just the steps!

Include the pseudocode of the program not the program just the pseudo code of it. Sample Run(Demonstration of what will display when you run it with words that are anagram) Game : Enter the 1st word amp Enter the 2nd word map amp and map are anagram Enter Yes to continue playing yes

Answer 1

Java code

import java.util.Arrays;
import java.util.Scanner;

public class Anagrams {

   public static void main(String[] args) {
       // TODO Auto-generated method stub

       boolean flag = true;
       String word1,word2,op;
       Scanner scan = new Scanner(System.in);
      
       while(flag) {
          
           System.out.println("Enter word 1: ");
           word1 = scan.next();
           System.out.println("Enter word 2: ");
           word2 = scan.next();
          
           if(isAnagram(word1,word2)) {
              
               System.out.println(word1+" and "+word2+" are Anagrams.");
           }
          
           else
               System.out.println(word1+" and "+word2+" are not Anagrams.");
          
           System.out.println("Do you want to enter more word(y/n): ");
           op = scan.next();
          
           if(op.compareToIgnoreCase("n")==0) {
              
               flag = false;
           }
       }
      
      
      
   }

   private static boolean isAnagram(String word1, String word2) {
       // TODO Auto-generated method stub
      
       char[] array1 = word1.toCharArray();
       Arrays.sort(array1);
   word1 = new String(array1);
       char[] array2 = word2.toCharArray();
       Arrays.sort(array2);
       word2 = new String(array2);
       if(word1.compareTo(word2)==0)
           return true;
       return false;
   }

}

Output

Enter word 1:
map
Enter word 2:
ampp
map and ampp are not Anagrams.
Do you want to enter more word(y/n):
y
Enter word 1:
AMP
Enter word 2:
MAP
AMP and MAP are Anagrams.
Do you want to enter more word(y/n):
y
Enter word 1:
lock
Enter word 2:
kocl
lock and kocl are Anagrams.
Do you want to enter more word(y/n):
n

Screenshot

Anagrams.java x while(flag) { System.out.println("Enter word 1: "); word1 = scan.next(); System.out.println("Enter word 2: "); word2 = scan.next(); if(isAnagram(word, word)) { System.out.println(word1+" and "+word2+" are Anagrams."); else System.out.println(word1+" and "+word2+" are not Anagrams."); System.out.println("Do you want to enter more word(y/n): "); op = scan.next(); if(op.compareToIgnoreCase("n")==0) { flag = false; X B 3 - 9 - --E Console X <terminated > Anagrams [Java Application] C:\Program Files\ava\jre 1.8.0_152\bin\javaw.exe (Apr 17, 2020, 1:31:48 PM) Enter word 1: AMP Enter word 2: MAP AMP and MAP are Anagrams. Do you want to enter more word(y/n): Enter word 1: lock Enter word 2: kocl lock and kocl are Anagrams Do you want to enter more word(y/n):