[LRUG] Recursion diversion

[Andrew Stewart]

On 25 Oct 2013, at 15:21, Andrew Stewart <boss at airbladesoftware.com> wrote:
> Given two strings a and b, I would like to find all the occasions where the letters of b appear in the same order in a.  The result should be an array of arrays where each inner array contains the indices of b's matches in a.

Thanks, everyone, for all the solutions.  I admire the ingenuity (deviousness?) of your thinking.

This strikes me as the kind of problem where there are a number of ways one can approach – but some are much more promising than others.  Are there any good resources out there for learning about preferred ways to tackle this kind of iterative/recursive challenge?

Thanks again,
Andy