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 Challenge // Programm: VogelsangerSamuel.cpp // Autor: Samuel Vogelsanger // draws a turtle graphic for the Lindenmayer system with // production F -> F+F+F-F-F // ___ // | | | // |___| | #include #include void f (const unsigned int i) { if (i == 0) ifm::forward(); // F else{ f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::left(90); // + f(i-1); // w_{i-1}^F ifm::right(90); // - f(i-1); // w_{i-1}^F ifm::right(90); // - f(i-1); // w_{i-1}^F } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; f(n); return 0; }