Following up on the next_permutation from a
couple of weeks ago
word finder uses
next_permutation to find words in character sequences. Uses the
aspell C api to look up each
permutation. Searching for 3,4,5 and 6 character words in a 6
character sequence takes about 200ms.
Using C++11 meant that I could use a nice lambda expression to process each permutation by passing the function object to the permute() function.