| var keyPressed; | |
| document.onkeyup = function(event) { | |
| keyPressed = String.fromCharCode(('which' in event) ? event.which : event.keyCode); | |
| input(); | |
| }; | |
| function input() { | |
| if(keyPressed == "D") document.write("hi"); | |
| } |
| function countdowntimer(element, secs) { | |
| var i = (secs) ? secs : element.innerHTML; | |
| var t1 = setInterval(function() { | |
| if(i != 0){ | |
| i--; | |
| } | |
| else{ | |
| clearInterval(t1); | |
| //timer ends here | |
| } |
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title>Turm Fort Stahlberg</title> | |
| <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> | |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
| <link rel="stylesheet" href="style.css"> | |
| <script src></script> | |
| </head> | |
| <body> |
| console.log("\n"); | |
| var i = 10; | |
| function writeD(d){ | |
| document.write(d); | |
| } | |
| function fixDecimal(num) { | |
| return Math.round(num * 10) / 10; | |
| } | |
| function Timer (milisecs, callback) { | |
| var t; |
| <form action="/message"> | |
| <p> | |
| <label for="user_tel">Telephone:</label> | |
| <input type="text" id="user_tel"><br /> | |
| </p> | |
| <p> | |
| <label for="user_msg">Message:</label> | |
| <textarea name="" id="user_msg" cols="30" rows="10"> | |
| </textarea><br /> |
| \[\033[0;36m\]\A \[\033[0;37m\][ \[\033[0;34m\]\u@\h\[\033[1;34m\] \W \[\033[0;37m\]]\$\[\033[00m\] |
| def range(start, stop, step = 1): | |
| x = start | |
| while True: | |
| if x >= stop: return | |
| yield x | |
| x += step | |
| # Erzeugung eines Turnierplans mit n Teilnehmern | |
| # Eingabe von n |
Unser Vorgehen: dominante Operation auswählen und Kosten grob ausrechnen
Problemgröße: präzise Beschreibung des Umfangs der zu verarbeitenden Daten, von dem Zeit- bzw. Speicherverhalten von Lösungsalgorithmen maßgeblich beeinflusst wird.
Kostenmaß: legt fest, in welchem Maße Operationen bei der Aufwandsbestimmung berücksichtigt werden
| open System | |
| // printfn "Hello, world!" | |
| type Tree<'a> = | |
| | Node of Tree<'a> * Tree<'a> | |
| | Leaf of 'a | |
| let rec travelTree tree = | |
| match tree with |