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 - Zusatzaufgabe // Programm: StraessleTimo.cpp // Autor: Timo Strässle (Gruppe P) #include #include void f (const unsigned int i) { if (i == 0) { ifm::forward(); } else { f(i-1); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::left(90); f(i-1); ifm::right(90); f(i-1); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; f(n); ifm::left(60); f(n); ifm::left(120); f(n); ifm::left(60); f(n); return 0; }