John VanSickle wrote:
> Do you have problems with it turning into an O(n^2) problem, or is there > some kind of shortcut to make things go faster?
AFAIK the method I use is faster than O(n^2), although it might not
be immediately obvious from the code.
(Although don't quote me on that. Trying to prove that claim is
actually quite difficult... :P )
