Random Thoughts

  1. Given a lexicon with n entries and m characters, find all valid entries from the lexicons that uses some or all m characters. How fast is the algorithm?
 
kb/random_thoughts.txt · Last modified: 2008/09/22 22:06 (external edit)     Back to top