# Recursive algorithms

This lesson allows to experiment with recursive algorithms.

If you need more recursive algorithms, an exercise on recursive sorting algorithms (in particular QuickSort and MergeSort) is planned in the future within the sorting lesson.

### What can I do to improve this lesson?

As usual, there are several things that could be done in this lesson to improve it further:

- The Sierpinski triangle can be drawn using a simpler L-system. See http://jpvallon.free.fr/recursivite.html
- The arrowhead curve is also interesting: http://www.mathcurve.com/fractals/sierpinski/sierpinskitriangle.shtml
- The dragon curve could be explained as a L-system: http://ecademy.agnesscott.edu/~lriddle/ifs/heighway/heighway.htm
- The dragon2 curve is called the twin dragon: http://ecademy.agnesscott.edu/~lriddle/ifs/heighway/twindragon.htm
- The space filling curves could be added (Peano, Hildebert, etc). See: http://teachout1.net/village/fill.html
- We could do another exercise on embeeded polygons: http://www.inrialpes.fr/helix/people/genoud/ENSJAVA/tds/sujets/dessinsReccursifs/actionsrecursives.html