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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Informatik - HS 2011 // Program: BuchmannSven.cpp // Autor: Sven Buchmann #include #include //POST: the word w_i ^F is drawn void f ( const unsigned int i) { if (i == 0) ifm::forward (); //F else { f(i -1); //w_{i -1}^ F ifm::left (90); //+ f(i -1); //w_{i -1}^ F f(i -1); //w_{i -1}^ F ifm::right (90); //- f(i -1); //w_{i -1}^ F ifm::left (90); //+ f(i -1); //w_{i -1}^ F f(i -1); //w_{i -1}^ F ifm::left (90); //+ f(i -1); //w_{i -1}^ F } } int main () { std::cout << " Number of iterations =? "; unsigned int n; std::cin >> n; f(n); ifm::left (90); f(n); ifm::left (90); f(n); ifm::left (90); f(n); return 0; }