// Code um Turtle Bibliothek zu importieren, welche wir im Folgenden nutzen %mavenRepo bintray https://dl.bintray.com/egp/maven %maven ch.unibas.informatik:jturtle:0.5 import ch.unibas.informatik.jturtle.Turtle; Turtle turtle = new Turtle(); static void drawRightAngledTriangle() { turtle.home(); turtle.clear(); turtle.penDown(); int lengthLegs = 100; turtle.forward(lengthLegs); turtle.turnRight(90); turtle.forward(lengthLegs); turtle.turnRight(135); turtle.forward(Math.sqrt(lengthLegs * lengthLegs + lengthLegs * lengthLegs)) ; turtle.turnRight(90); display(turtle.toImage()); } drawRightAngledTriangle(); drawRightAngledTriangle(); Turtle turtle = new Turtle(); static void drawRightAngledTriangle(int lengthLegs) { turtle.home(); turtle.clear(); turtle.penDown(); turtle.forward(lengthLegs); turtle.turnRight(90); turtle.forward(lengthLegs); turtle.turnRight(135); turtle.forward(Math.sqrt(lengthLegs * lengthLegs + lengthLegs * lengthLegs)) ; turtle.turnRight(90); display(turtle.toImage()); }; drawRightAngledTriangle(100); Turtle turtle = new Turtle(); static double computeHypothenuse(double a, double b) { return Math.sqrt(a * a + b * b); } static void drawRightAngledTriangle(int lengthLegs) { turtle.home(); turtle.clear(); turtle.penDown(); turtle.forward(lengthLegs); turtle.turnRight(90); turtle.forward(lengthLegs); turtle.turnRight(135); turtle.forward(computeHypothenuse(lengthLegs, lengthLegs)); turtle.turnRight(90); display(turtle.toImage()); }; drawRightAngledTriangle(100); class C { static int a; static void p() { int x; } static void q() { System.out.println(a); int y; } } class Sample { static int x = 0; static void P() { System.out. println( x); } static void experiment() { System.out. println( x); //int x = 1; System.out. println( x); P(); if (x > 0) { int x; int y; } else { int y; } // for (int i = 0; i < 5; i++) { System.out.println(i); } // for (int i = 1; i < 5; i++) { System.out.println(i); } } } Sample.experiment(); void f(int i) { f(i); } f(5); // Implementation static int factorial(int n) { System.out.println(n); if (n == 1) { return 1; } return factorial(n - 1) * n; } factorial(4); // Implementation static void drawSierpinskiRec(Turtle turtle, double length, int depth) { if (depth==0){ for (int i = 0; i < 3; i++) { turtle.forward(length); turtle.turnLeft(120); } } else { drawSierpinskiRec(turtle, length/2.0 , depth-1); turtle.forward(length/2); drawSierpinskiRec(turtle, length/2.0, depth-1); turtle.backward(length/2); turtle.turnLeft(60); turtle.forward(length/2); turtle.turnRight(60); drawSierpinskiRec(turtle, length/2.0,depth-1); turtle.turnLeft(60); turtle.backward(length/2); turtle.turnRight(60); } } static void drawSierpinski(double length, int depth) { Turtle turtle = new Turtle(); turtle.home(); turtle.penDown(); drawSierpinskiRec(turtle, length, depth); display(turtle.toImage()); } drawSierpinski(150.0, 8) static int binaryLog(int n) { int i = 0; while (n > 1) { i += 1; n = n / 2; } return i; } binaryLog(3); static int ggt(int a, int b) { int rest = a % b; while (rest != 0) { a = b; b = rest; rest = a % b; } return b; } static void reduce(int z, int n) { int ggt = ggt(z, n); System.out.println((z / ggt) +"/" + (n / ggt)); } reduce(16, 8); static double area(double a, double b, double c) { // siehe https://en.wikipedia.org/wiki/Heron's_formula double s = (a + b + c) / 2.0; return Math.sqrt(s * (s - a) * (s - b) * (s - c)); } area(4, 13, 15);