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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// IFMP - Serie 11 - Skript-Aufgabe 17 // Programm: SchneiderTim.cpp // Autor: Tim Schneider #include #include // Sonne (ca. 24) void q (const unsigned int i); void s (const unsigned int i) { if (i <= 0) return; ifm::forward(); ifm::right(60); q(i-1); ifm::forward(); ifm::left(180); ifm::forward(); } void p (const unsigned int i) { if (i <= 0) return; ifm::right(60); ifm::forward(); ifm::forward(); q(i-1); ifm::forward(); ifm::left(90); } void q (const unsigned int i) { if (i <= 0) return; s(i-1); ifm::forward(); s(i-1); ifm::forward(); ifm::forward(); p(i-1); } int main () { std::cout << "Number of iterations =? (Try out 24)"; unsigned int n; std::cin >> n; s(n); return 0; }