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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Lindenmayer Challenge // Program: ArnoldJonas.cpp // Author: Jonas Arnold #include #include void myprogram(int i) { if(i==0) { ifm::right(120); ifm::forward(30); } if(i>0) { ifm::forward(30); ifm::right(60); ifm::forward(60); myprogram(i-1); ifm::left(60); ifm::forward(30*i); myprogram(i-1); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; myprogram(n); return 0; }