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 - Skriptaufgabe 125 // Prog: LuchsingerFabio.cpp // Author: Fabio Luchsinger #include #include void f (unsigned int i) { if (i == 0) ifm::forward(); // F else { f(i-1); ifm::forward(); ifm::left(13); ifm::forward(); ifm::right(13); ifm::save(); ifm::right(13); f(i-1); ifm::forward(); ifm::right(13); f(i-1); ifm::left(13); ifm::restore(); ifm::save(); ifm::left(13); f(i-1); ifm::right(13); ifm::restore(); f(i-1); } } int main () { std::cout << "Type in the Number of iterations = "; unsigned int n; std::cin >> n; ifm::left(90); f(n); return 0; }