搜索资源列表
wordMapSearch
- 在词典中找出给定的字符串的所有变位词 Find all anagram groups in a ictionary, and print them to standard output stream
wordMapSearch
- 在词典中找出给定的字符串的所有变位词 Find all anagram groups in a ictionary, and print them to standard output stream-In the dictionary to find the given string to all mutase word Find all anagram groups in a ictionary, and print them t
anagram
- program for anagrams it ll help in generate anagrams from a word
T1_4
- this program calculate the anagram of a number among 1000-9999.
eAssistant
- Anagram helper, NOT FINISHED
Problems
- Anagram algorithm, which means to solve the problem
AnagramGame
- anagram game in java
main
- solving anagram in ansi c language
angs
- Anagrams finder in Scheme, load anagrams list from disk, then searches corresponding anagram in list. Run using Dr. Scheme.
AnagramGame
- anagram game in java. very usefull to learning java programming language...as easy as hello world
Anagram
- 如果两个单词的组成字母完全相同，只是字母的排列顺序不一样，则它们就是变位词，两个单词相同也被认为是变位词。如tea 与eat , nic 与cin, ddc与dcd, abc与abc 等。你的任务就是判断它们是否是变位词。-If the composition of two letters the same word, just not the same as the sequence of letters, these are the
anagram
- used to check whether the given string is anagram or not.In order to get a new phrase or word by rearranging the words
Anagram
- Programa for a type de anagram
Anagram
- ANAGRAM is a C++ program which takes a string of letters and tries to produce as many anagrams as possible
Anagram
- This a program that tells you if a string is an anagram using recusion-This is a program that tells you if a string is an anagram using recusion
Anagram
- 判断连个但是是否是anagram的方法，复杂度为O(nlogn),anagram是指两个单词缩包含的字母相同-But even a judge whether anagram way, complexity is O (nlogn)
Anagram
- 一个找同字母英语单词的小游戏，用C语言和assembly写的-a small game which is about finding anagram, coded by C and Assembly
anagram
- algorithm recursive check a world is anagram
anagram
- this package should denotes the program of anagram and should defines how to build anagram
Anagram
- The code is about anagram where you can compare. Complexity BigO = O(1)