Click on the Green Flag!
A simple implementation of the HH Dragon fractal using the modulo operator. No recursion here but rather we simply find an odd k such that: n = k*2**m where n is the step number (1, 2, 3 ...), k is an odd number and m is non-negative integer (0, 1, 2 ..) Music: Flight of the Bumblebee
