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 - Skript-Aufgabe 127 //Progm: MeierSonja1.cpp //Titel: Katze //Nice with 5 iterations //Autor: Sonja Meier #include #include //Post : the word w_i ^ F is drawn void f (const unsigned int i) { if (i == 0) ifm::forward(); else { f(i-1); ifm::left(30); f(i-1); ifm::right(150); f(i-1); ifm::left(30); f(i-1); ifm::right(70); } } int main() { std::cout << "Number of iterations?" << std::endl; unsigned int n; std::cin >> n; f(n); return 0; }