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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// lindenmayer_own.cpp // Dario Kermanschah // Sheet 9, Challenge #include #include void y (const unsigned int n); void x (const unsigned int n) { if (n == 0) ifm::forward(); // X else { // Reproduktion Y-Y-X y(n-1); ifm::right(60); y(n-1); ifm::right(60); x(n-1); } } void y (const unsigned int n) { if (n == 0) ifm::forward(); // Y else { // Reproduction X+X+Y x(n-1); ifm::left(60); x(n-1); ifm::left(60); y(n-1); } } int main () { std::cout << "Number of iterations: "; // for best result start with: 8 unsigned int n; std::cin >> n; y(n); return 0; }