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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//Informatik-Serie 11-Aufgabe 127 // Prog: WittmannAngela.cpp //Autor: Angela Wittmann (GruppeC) // 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(); ifm::left(150); ifm::forward(); } else { f(i-1); // w_{i-1}^F ifm::left(120); // + f(i-1); // w_{i-1}^F ifm::left(60); // + } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n(F) f(n); return 0; }