Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Prog: MahantaSushanta.cpp // Draw turtle graphics for the Lindenmayer system with // production F -> F+F+ and initial word F. #include #include // POST: the word w_i^F is drawn void f (const unsigned int i) { if (i == 0) ifm::forward(); else { f(i-1); //F ifm::left(135); //+ f(i-1); //F ifm::right(45); //- f(i-1); //F ifm:: right(90); //- } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n(F) f(n); return 0; }