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 // Program: HynekPaul.cpp // Author: Hynek Paul // Draw a "spiky ball" #include #include // POST: the word w_i^F is drawn void f (const unsigned int i) { if (i == 0) ifm::forward(); // F else { f(i-1); ifm::forward(); f(i-1); ifm::save(); ifm::right(30); f(i-1); ifm::forward(); f(i-1); ifm::forward(); ifm::restore(); ifm::left(30); ifm::forward(); ifm::right(30); f(i-1); ifm::forward(); ifm::left(30); } } int main () { std::cout << "Please enter the number of iterations " << "(Why not 7?):\n"; unsigned int n; std::cin >> n; // draw w_n = w_n(F) f(n); ifm::right(30); ifm::forward(); f(n); ifm::left(30); ifm::forward(); f(n); ifm::right(30); ifm::forward(); f(n); ifm::left(30); ifm::forward(); f(n); return 0; }