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 127 // Program: DelReEnrico.cpp // Autor Enrico Del Re #include #include void g(const unsigned int i); void f (const unsigned int i) { if (i == 0) ifm::forward(2); else { (i-1); ifm::left(30); ifm::forward(2); ifm::right(180); ifm::forward(2); ifm::right(59); g(i-1); } } void g(const unsigned int i) { if (i==0) ifm::forward(); else { ifm::forward(1); ifm::left(930); ifm::forward(2); ifm::right(30); f(i); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n(F) f(n); return 0; }