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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik - Challenge Aufgabe (lindenmeyer-system) // Programm: EnderleRalph.cpp // Autor: Ralph Enderle #include #include void f (const unsigned int i) { if (i == 0) ifm::forward(); else { f(i-1); ifm::right(90); f(i-1); ifm::left(30); f(i-1); ifm::left(30); f(i-1); ifm::left(30); f(i-1); ifm::left(30); f(i-1); ifm::left(30); f(i-1); ifm::left(30); f(i-1); ifm::right(90); f(i-1); ifm::left(45); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; f(n); return 0; }