I think you are right, What we have here is a N-way diff (where N is the number of strings).
My guess is that it is horribly explosive in N.
A 2-way diff is bad enough that it takes caching to perform adequately. N-way would be much, much worse.
In reply to Re^3: Challenge: Generate a glob patterns from a word list
by tybalt89
in thread Challenge: Generate a glob patterns from a word list
by choroba
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |