Comment: GCDs in a regex (Score 1) on 2009.12.17 10:38
I was very proud of this recent substitution that implements the Euclidean algorithm:
http://perlmonks.org/?node_id=804838
It follows in the fine tradition of the regex primality test by using repeated capturing groups to perform division with remainder.
Read More
7 comments
