Scribd
Upload
63 views

Anagram

This Java code finds all anagrams of a given string by recursively permuting the characters and printing out each anagram. It takes in a string, stores the characters in an array, and calls the doAnagram method. doAnagram recursively calls itself to generate all permutations by rotating the characters, and display prints out each full anagram once generated.

Uploaded by

Mahesh Kumar Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
63 views

Anagram

This Java code finds all anagrams of a given string by recursively permuting the characters and printing out each anagram. It takes in a string, stores the characters in an array, and calls the doAnagram method. doAnagram recursively calls itself to generate all permutations by rotating the characters, and display prints out each full anagram once generated.

Uploaded by

Mahesh Kumar Reddy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

import java.io.

IOException; public class AnagramApp { static int size; static int count; static char[] charArray; public static void main(String[] args) throws IOException { String input = "Java Source and Support"; size = input.length(); count = 0; charArray = new char[size]; for (int j = 0; j < size; j++) charArray[j] = input.charAt(j); doAnagram(size); } public static void doAnagram(int newSize) { int limit; if (newSize == 1) // if too small, return; return; // for each position, for (int i = 0; i < newSize; i++) { doAnagram(newSize - 1); // anagram remaining if (newSize == 2) // if innermost, display(); rotate(newSize); // rotate word } } // rotate left all chars from position to end public static void rotate(int newSize) { int i; int position = size - newSize; // save first letter char temp = charArray[position]; //shift others left for (i = position + 1; i < size; i++) charArray[i - 1] = charArray[i]; //put first on right charArray[i - 1] = temp; } public static void display() { System.out.print(++count + " "); for (int i = 0; i < size; i++) System.out.print(charArray[i]); System.out.println(); } }

You might also like