> 1. Start with the first element (call it L) > 2. Scan downwind for an matching element (call it R) > 3. Compare L+1 and R+1 until you find a mismatch -- that's the current > "largest" match. > 4. Repeat from 2 to see if you can find a longer match.
Actually, step "4. Repeat from 2...", can be further optimized with searching for match between preceding element of R and element shifted by R positions relative to R, then couple of routine random checks for matches in between L and R and shifted values by R positions ;) _______________________________________________ python-win32 mailing list python-win32@python.org http://mail.python.org/mailman/listinfo/python-win32
