ian erik varatalu personal blog
Finding all regex matches has always been O(n²)
every regex engine that promises linear time breaks that promise the moment you ask for all matches. the problem has been there since the 70s, hiding in the iteration loop.
- Points
- 260
- HN comments
- 70
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2026
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Mar 19, 2026 | Finding all regex matches has always been O(n²) by lalitmaganti | 260 | 70 |
