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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//Informatik: Serie - Serie 11- Aufgabe 127 //Program: CacciaGiacomo.cpp //Autor: Giacomo Caccia #include #include // POST: w_i^X is drawn void x (const unsigned int i) { if(i>1) { ifm::left(90); ifm::forward(); ifm::save(); ifm::forward(); ifm::right(90); ifm::forward(); ifm::right(90); ifm::forward(); x(i-1); ifm::restore(); ifm::right(90); ifm::forward(); ifm::forward(3); x(i-1); ifm::left(35*i); ifm::forward(); ifm::right(45); ifm::forward(3); } else { ifm::forward(); ifm::left(60); ifm::forward(2); ifm::right(65); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n^X x(n); return 0; }