From 8c57d7c8f80f2567773871c4ad46b69d1f3e3461 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jos=C3=A9=20Carlos=20Garc=C3=ADa?= Date: Mon, 12 Sep 2016 14:42:17 +0200 Subject: Added article detecting prime numbers with regex --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 4cc1deb..6360161 100644 --- a/README.md +++ b/README.md @@ -107,6 +107,7 @@ Sharing, suggestions and contributions are always welcome! Please take a look at - [The Bad, the Better, and the Best](https://www.loggly.com/blog/regexes-the-bad-better-best/) - How a few characters can make a difference in performance - [The Greatest Regex Trick Ever](http://www.rexegg.com/regex-best-trick.html) - So you're doubtful at the mention of a "best regex trick"? - [Treat regular expressions as code, not magic](http://alexwlchan.net/2016/04/regexes-are-code/) - If you don’t write them carefully, you can end up with an unmaintainable monstrosity +- [Demystifying The Regular Expression That Checks If A Number Is Prime](https://iluxonchik.github.io/regular-expression-check-if-number-is-prime/) - How a regular expression can check if a number is prime ## Books -- cgit v1.2.3