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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//Informatik: Serie - Serie 11- Aufgabe 127 //Program: BaldacchinoOliver3.cpp //Autor: O. Baldacchino #include #include using namespace std; void y (const unsigned int i); void x (const unsigned int i) { if (i > 0){ x(i-1); ifm::left(21); ifm::forward(0.61); y(i-1); ifm::forward(0.61); x(i-1); ifm::left(60); } } void y (const unsigned int i){ if (i > 0){ ifm::right(42); ifm::forward(1.61); ifm::jump(); x(i-1); ifm::left(42); y(i-1); ifm::forward(3.22); x(i-1); ifm::jump(1.61); } } /* void y (const unsigned int i); void x (const unsigned int i) { if (i > 0){ y(i-1); ifm::left(60); x(i-1); ifm::right(60); y(i-1); } else{ ifm::forward();} } void y (const unsigned int i) { if (i > 0){ x(i-1); ifm::left(60); y(i-1); ifm::right(60); x(i-1); } else{ ifm::forward();} } */ int main () { unsigned int n; std::cout <<"Numbers of iteration = ?"; std::cin >> n; y(n); return 0; }