kigland b85762fe4d perf: replace O(n³) brute-force LCS with difflib.SequenceMatcher
The fitness function's longest common substring search used a triple-nested
loop. With 12,800 evaluations per optimization run, this was a significant
bottleneck. SequenceMatcher provides O(n*m) average-case performance.
2026-03-08 15:14:25 +08:00
2026-03-08 01:57:41 +00:00
2026-03-08 09:03:03 +08:00
2026-03-08 01:53:05 +00:00
2026-03-08 09:03:03 +08:00
S
Description
No description provided
GPL-3.0
813 KiB
Languages
Python 100%