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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik I - Lindenmayer-Challenge // Programm: AndraeMarie.cpp // Autor: Marie AndrŠ #include #include // POST: the word w_i^F is drawn void f (const unsigned int i) { if (i == 0) ifm::forward(); // F else { f(i-1); // w_{i-1}^F ifm::right(90); // - f(i-1); // w_{i-1}^F ifm::forward(); ifm::left(90); // ++ f(i-1); // w_{i-1}^F ifm::right(45); // - f(i-1); // w_{i-1}^F } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n^F++w_n^F++w_n^F f(n); // w_n^F ifm::left(45); // ++ f(n); // w_n^F ifm::right(90); // ++ f(n); // w_n^F return 0; }