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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik - Serie N - Aufgabe N // Program: IndoleseDavid.cpp // Autor: David Indolese #include #include void f( const unsigned int i) { if (i == 0) ifm::forward(); else { ifm::right(30); f(i-1); ifm::left(60); f(i-1); ifm::right(190); } } int main() { std::cout << " number of iterations =?"; unsigned int n; std::cin >>n; f(n); return 0; }