Alpha And Trees
SCENE II
Somewhere in the not-so-rural area of Seattle a frantically Nick Gravelyn.
Nick. […] And while even I would argue a content processor is a better place to handle things, I decided it would be a good first project for a Paint.NET plugin.
Off. Enter Jon Watte and a follower to grow some trees.
Jon. The problem is that your search space is *huge*. The number of combinations is a factorial, which grows faster than exponential!
Instead, you should order your word dictionary as a tree. Then keep a counter for each of the 26 possible characters. Do a tree search, where you descend into a child node if you still have an appropriate letter.
The follower. Wow [Jon], that took my average performance from 10-15MS to under 1 MS. Quite the difference.
Rejoice.
Nick (from the spheres). I do too much.
Enter George W. Clingerman as the Reindeer.
George. I see the light!
The Christmas bells ring.