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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// Prog: DunaiCsaba5.cpp // Draw turtle graphics #include #include // POST: the word w_i^F is drawn void g (const unsigned int i, const unsigned int angle) { if (i == 0) { ifm::forward(2); } else { g(i-1, angle); ifm::right(170); g(i-1, angle); } } void f (const unsigned int i, const unsigned int angle) { if (i == 0) { ifm::forward(); ifm::left(15); ifm::forward(); ifm::right(2*15); ifm::forward(); ifm::left(15); ifm::right(30); ifm::right(180); ifm::left(15); ifm::forward(); ifm::right(2*15); ifm::forward(); ifm::left(15); ifm::forward(); } else { f(i-1, angle); ifm::right(170); f(i-1, angle); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; //std::cin >> n; std::cout << "Angle =? "; unsigned int a; //std::cin >> a; // draw w_n = w_n(F) // for(int i=1; i<360; ++i){ ifm::save(); f(10,30); // } ifm::restore(); ifm::right(3.5); ifm::jump(3.5); g(10, 30); return 0; }