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- Aufgabe 127 // Program: GopalaBulloni2.cpp // Autor: Bulloni Gopala // 7 iteration #include #include void f (const unsigned int i) { if (i == 0) ifm::forward(); else { f(i-1); ifm::right(15); f(i-1); ifm::right(45); f(i-1); ifm::left(110); f(i-1); ifm::left(10); f(i-1); } } int main () { std::cout << "Number of iterations = ? "; unsigned int n; std::cin >> n; f(n); ifm::left(120); // for do the same draw turned 3 times f(n); ifm::left(120); f(n); return 0; }