//Recursive functions: factorials int [ ] n = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }; void setup ( ) { size ( 600, 500 ); } void draw ( ) { fill ( 0 ); textSize ( 16 ); for ( int j = 0 ; j < n. length; j++ ) { text ( factorial ( n [ j ] ), 100, 100 + 20 * j ); } } int factorial ( int n ) { //factorial if ( n < 2 ) return 1; return n * factorial ( n - 1 ); }