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 skriptaufgabe 127 // programm: OttoJan.cpp // autor: jan otto #include #include // POST: the word w_i^F is drawn void f (const unsigned int i, int a) { if (i == 0) { ifm::forward(); ifm::right(45); ifm::forward(); ifm::left(90); ifm::forward(); ifm::right(45); ifm::forward(); ifm::right(90); ifm::forward(); ifm::right(45); ifm::forward(); ifm::left(45); ifm::forward(); ifm::right(45); ifm::forward(); } else { f(i-1, 45); ifm::right(90); f(i-1, 45); } } int main () { std::cout << "Number of iterations =? "; unsigned int n; std::cin >> n; // draw w_n = w_n(F) for(unsigned int i=1; i