Pinned

1. exprify exprify Public

   Transpile Python code into executable ASCII art by converting to expression-only syntax.

   Python 2

2. zipyphus zipyphus Public

   Create zip files from scratch in Python

   Python 1

3. branchless_bisect branchless_bisect Public

   Beating the `bisect` module's implementation using C-extensions.

   C 31 2

4. rijndael.py rijndael.py

   1

   n=256;q, t, m, e, p, c, f=(range(n),16,lambda x

   2

         ,y,       r=0:m((h:=x   <<1,h^283)[

   3

        h&n!=      0],y>>      1,(r,r    ^x)

   4

       [y&1])if    y else       r,lambda

   5

      a,w= 1,p=n   -2:e(m(a,       a),(w,m

5. pi_shaped.py pi_shaped.py

   1

   from functools import reduce as red; from math import \

   2

   (factorial as fact, comb);import sys;from decimal import \

   3

         (getcontext as c,Decimal as dc);(a:=range,

   4

          b:=int(sys.                 argv[1]));c\

   5

          ().prec=b;                  ber=lambda\

6. gauss-legendre.md gauss-legendre.md

   1

   20 million digits of pi in under a minute with Julia

   2

   ====================================================

   3

   4

   I recently discovered a relatively obscure algorithm for calculating the digits of pi: https://en.wikipedia.org/wiki/Gauss–Legendre_algorithm.

   5

   Well, at least obscure compared to Chudnovsky's. Wikipedia notes that it is "memory-intensive" but is it really?