for the latest chapter of what's becoming a blog on the most cursed bash you can imagine, let's do some maths together
euclid's algorithm for gcd could be written like this in python:
>>> def gcd(a, b):
... if b:
... return gcd(b, a%b)
... return a| sed 'sentence;secede;secede' <<< canter # canter -> cancer -> dancer -> dander | |
| sed 'severe;serene;secede' <<< cove # cove -> core -> cone -> done | |
| sed 'septette;settee' <<< Capt # Capt -> Catt -> Ca | |
| sed 'severe;serene' <<< Iva # Iva -> Ira -> Ina | |
| sed 'severe;serene' <<< paves # paves -> pares -> panes | |
| sed 'secrete;settee' <<< critter # critter -> titter -> tier | |
| sed 'severe;serene' <<< v # v -> r -> n | |
| sed 'severe;serene' <<< coves # coves -> cores -> cones | |
| sed 'severe;serene' <<< vapes # vapes -> rapes -> napes |