{"id":332,"date":"2018-10-04T12:40:07","date_gmt":"2018-10-04T12:40:07","guid":{"rendered":"http:\/\/iludis.de\/?p=332"},"modified":"2018-12-24T15:16:13","modified_gmt":"2018-12-24T15:16:13","slug":"pythonskripte-inf-4stuender","status":"publish","type":"page","link":"https:\/\/iludis.de\/?page_id=332","title":{"rendered":"Pythonskripte Inf4St. Teil I"},"content":{"rendered":"

FizzBuzz: <\/strong>Einstieg in Python<\/em><\/p>\n

for k in range (1,100,1):\r\n    if k%3 == 0 or k%5 == 0:\r\n        if k%5 !=0:\r\n            print("fizz"" ", end="")\r\n        if k%3 !=0:\r\n            print("buzz"" ", end="")\r\n        if k%3 == 0 and k%5 == 0:\r\n            print("fizzbuzz"" ", end="")\r\n    else:\r\n        print (k," ", end="")<\/pre>\n
Linear Search: <\/strong>mit Zufallslisten-Generator und Zeitmessung f\u00fcr die Zeitkomplexit\u00e4t<\/em><\/p>\n
import random\r\nimport time\r\nmeineliste=[]\r\n\r\nfor i in range(0,20):\r\n    zufall = random.randint(1,100)\r\n    meineliste.append(zufall)\r\nprint(meineliste)\r\n\r\nstartzeit = time.monotonic_ns()\r\nmaximum = meineliste[0]\r\nfor i in range(1, len(meineliste)):\r\n    time.sleep(0.01)\r\n    if maximum<meineliste[i]:\r\n        maximum = meineliste[i]\r\n        print("vorl\u00e4ufiges Maximum: ", maximum)\r\n        time.sleep(0.01)\r\nprint("-------------------------------------------")\r\ndauer = (time.monotonic_ns()-startzeit)\/1000000\r\nprint("zeitdauer in milli-Sekunden: ", dauer)\r\nprint("endg\u00fcltiges Maximum: ", maximum)<\/pre>\n
BubbleSort:<\/strong>\u00a0mit Zufallslisten-Generator und Zeitmessung f\u00fcr die Zeitkomplexit\u00e4t<\/em><\/p>\n
import random\r\nimport time\r\n\r\nmliste = []\r\nfor k in range (0,20):\r\n    mliste.append(random.randint(1,100))\r\n\r\nprint(mliste)\r\n\r\nstartzeit = time.monotonic_ns()\r\n# bubblesort\r\nfor m in range(0,len(mliste)-1):\r\n    time.sleep(0.01)\r\n    for i in range(0,len(mliste)-1-m):\r\n        time.sleep(0.01)\r\n        if mliste[i]>mliste[i+1]:\r\n            time.sleep(0.01)\r\n            temp = mliste[i+1]\r\n            mliste[i+1]= mliste[i]\r\n            mliste[i]=temp\r\n    print(mliste)\r\nendzeit = time.monotonic_ns()\r\nzeitdifferenz= (endzeit - startzeit)\/1000000\r\nprint("vergangene Zeit: ", zeitdifferenz)<\/pre>\n
Quicksort-Simulation:<\/strong>\u00a0Die Simulation aus dem Unterricht:
\n<\/em>https:\/\/www.hackerearth.com\/practice\/algorithms\/sorting\/quick-sort\/visualize\/<\/a>
\n<\/em><\/p>\n
Prinzip von Funktionen:<\/strong> mit Parameter\u00fcbergabe, Returnwert und globaler Variable f\u00fcr die R\u00fcckgabe<\/p>\n
import random\r\nimport time\r\n\r\ndef macheZufallsliste(listenlaenge, obergrenze):\r\n    print("\u00fcbergebener Parameter: " + str(listenlaenge))\r\n    meineListe = []\r\n    for i in range(0,listenlaenge):\r\n        meineListe.append(random.randint(1,obergrenze))\r\n    print ("noch im Stack:           ", meineListe)\r\n    return meineListe\r\n\r\nauffangVariable= macheZufallsliste(10,10)\r\n\r\nprint("aufgefangen \u00fcber Return: ", auffangVariable)\r\ntime.sleep(2)\r\nprint("aufgefangen \u00fcber Return: ", auffangVariable)<\/pre>\n
Selection-Sort:<\/strong> mit Linear-Search-Funktion und Python „append()“ bzw. „insert()“<\/p>\n
import random\r\n\r\ndef sucheLinear(testliste, modus):\r\n    if modus=="max":\r\n        maximum = testliste[0]\r\n        for num in testliste:\r\n            if num>maximum:\r\n                maximum = num\r\n        return maximum\r\n\r\n    if modus=="min":\r\n        minimum = testliste[0]\r\n        for num in testliste:\r\n            if num<minimum:\r\n                minimum = num\r\n        return minimum\r\n\r\nmliste = []\r\nfor k in range (20):\r\n    mliste.append(random.randint(1, 100))\r\n\r\nfor j in range (0, len(mliste)):\r\n    groesstesElement = sucheLinear(mliste[0:len(mliste)-j], "max")\r\n    print("aktuell gr\u00f6sstes Element:", groesstesElement)\r\n    mliste.remove(groesstesElement)\r\n    mliste.append(groesstesElement)\r\n    print("Sortier-Schritt ",j+1, ": ", mliste)\r\nprint("endg\u00fcltig sortierte Liste: ", mliste)<\/pre>\n
Stack-Simulation:<\/strong> Wie Funktionen im Speicher verwaltet werden, wichtig f\u00fcr Rekursion<\/em>
\nhttps:\/\/visualgo.net\/en\/list<\/a><\/p>\n
Rekursion: <\/strong>Skripte f\u00fcr das grundlegende Verst\u00e4ndnis. Stack Auf- und Abbau.<\/p>\n
def rek1(n):\r\n    if n>1:\r\n        print("lokales n: ", n)\r\n        n-= 1\r\n        rek1(n)\r\n    else:\r\n        print("lokales n: ", n, ", fertig: Basisfall, bzw. Abbruchbedingung")\r\n        n-= 1\r\n    print("lokales n: ", n)\r\n\r\nrek1(4)\r\nprint("------------------------------------------------------")\r\n\r\nsumme=0\r\ndef rek2(n):\r\n    global summe\r\n    if n>1:\r\n        summe=summe+n\r\n        print("Hin ...     lokales n: ", n, "summe: ", summe)\r\n        n-= 1\r\n        rek2(n)\r\n    else:\r\n        summe=summe+n\r\n        print("fertig.     lokales n: ", n, "summe: ", summe)\r\n        n-= 1\r\n    print("...& zur\u00fcck lokales n: ", n, "summe: ", summe)\r\n\r\nrek2(4)\r\nprint("------------------------------------------------------")\r\n\r\nprod=1\r\ndef rek3(n):\r\n    global prod\r\n    if n>1:\r\n        prod=prod*n\r\n        print("Hin ...     lokales n: ", n, "prod: ", prod)\r\n        n-=1\r\n        rek3(n)\r\n    else:\r\n        prod = prod * n\r\n        print("fertig.     lokales n: ", n, "prod: ", prod)\r\n        n -= 1\r\n    print("...& zur\u00fcck lokales n: ", n, "prod: ", prod)\r\n\r\nrek3(5)\r\nprint("------------------------------------------------------")\r\n\r\ndef rek4(n):\r\n    if n>1:\r\n        print("vorher, lokales n: ", n)\r\n        prod = n * rek4(n-1)\r\n        print("danach, lokales n: ", n, "zwischenergebnis: ", prod)\r\n        return prod\r\n    else:\r\n        print("fertig. Lokales n: ", n)\r\n        return 1\r\n    print("...& zur\u00fcck lokales n: ", n)\r\n\r\nrek4(5)\r\nprint("------------------------------------------------------")\r\n\r\ndef rek5(n):\r\n    if n>1:\r\n        print("vorher, lokales n: ", n)\r\n        knoten = rek5(n-1) + rek5(n-1)\r\n        print("Ast.  Lokales n: ", n, "zwischenknoten: ", knoten)\r\n        return knoten\r\n    else:\r\n        print("Blatt. Lokales n: ", n)\r\n        return 1\r\n    print("...& zur\u00fcck lokales n: ", n)\r\n\r\nrek5(3)\r\nprint("------------------------------------------------------")<\/pre>\n
Programm von F.S.:<\/strong> Quicksort-Implementierung<\/p>\n
import random\r\nlaenge=10\r\nlist=[]\r\n\r\nfor i in range (0,laenge):\r\n    list.append(random.randint(1,100))\r\n\r\nprint("Die zuf\u00e4llig ausgew\u00e4hlte Liste ist: ")\r\nprint(list)\r\n\r\ndef quicksort(list):\r\n    rekursion(list,0,len(list)-1)\r\n\r\ndef rekursion (list,first,last):\r\n    if first<last:                                 #Abbruchbedingung\r\n        splitpoint=sortieren(list,first,last)\r\n        rekursion(list,first,splitpoint-1)       #Rekursion f\u00fcr erste Listenh\u00e4lfte!\r\n        rekursion(list,splitpoint+1,last)        #Rekursionf\u00fcr zweite Listenh\u00e4lfte!\r\n\r\ndef sortieren(list,first,last):\r\n    pivot=list[last]\r\n    leftmark=first\r\n    rightmark=last-1\r\n    done=False\r\n    while not done:\r\n        while leftmark<=rightmark and list[leftmark]<= pivot:\r\n            leftmark=leftmark+1\r\n\r\n        while leftmark<=rightmark and list[rightmark]>= pivot:\r\n            rightmark=rightmark-1\r\n\r\n        if rightmark<leftmark:\r\n            done=True\r\n        else:\r\n            temp=list[rightmark]\r\n            list[rightmark]=list[leftmark]\r\n            list[leftmark]=temp\r\n\r\n    temp=list[leftmark]\r\n    list[leftmark]=list[last]\r\n    list[last]=temp\r\n\r\n    return leftmark\r\n\r\nquicksort(list)\r\nprint("--------------------------------------------------------------------------------------")\r\nprint("Die Liste ist nun sortiert.")\r\nprint(list)\r\nprint("--------------------------------------------------------------------------------------")<\/pre>\n
Programm von M.D.: <\/strong>Palindrompr\u00fcfung<\/p>\n
string_list = input()\r\n\r\ndef palyndrom2(stringarr_):\r\n    if len(stringarr_) > 1:\r\n            return stringarr_[0] == stringarr_[len(stringarr_)-1] and palyndrom2(stringarr_[1:len(stringarr_)-1])\r\n    else:\r\n        return True\r\n\r\nx = palyndrom2(string_list)\r\nprint(x);<\/pre>\n
Bin\u00e4rer Baum:<\/strong> Turtle-Grafik „ohne Schn\u00f6rkel“<\/em><\/p>\n
import turtle\r\n\r\ndef binbaum(maxtiefe, tiefe):\r\n    turtle.forward(100*pow(0.618,tiefe))\r\n\r\n    if tiefe < maxtiefe:\r\n        turtle.left(60)\r\n        binbaum(maxtiefe, tiefe+1)\r\n        turtle.right(120)\r\n        binbaum(maxtiefe, tiefe+1)\r\n        turtle.left(60)\r\n\r\n    turtle.backward(100*pow(0.618,tiefe))\r\n\r\nbinbaum(6,0)\r\n\r\nturtle.exitonclick()<\/pre>\n
Programm von M.M.:<\/strong> Bin\u00e4rer Baum mit Turtle-Grafik<\/p>\n
import turtle\r\ndef tree(x_):\r\n    if x_<=rek:\r\n        turtle.down()\r\n        turtle.forward(int(200\/(x_*1.675)))\r\n        leftfunk(x_)\r\n        rightfunk(x_)\r\n        turtle.up()\r\n        turtle.backward(int(200\/(x_*1.675)))\r\n\r\ndef leftfunk(x_):\r\n    if x_ <=rek:\r\n        turtle.left(winkel)\r\n        tree(x_+1)\r\n        turtle.right(winkel)\r\n\r\ndef rightfunk(x_):\r\n    if x_ <=rek:\r\n        turtle.right(winkel)\r\n        tree(x_+1)\r\n        turtle.left(winkel)\r\n\r\nglobal rek\r\nglobal winkel\r\nwinkel=30\r\nrek=8\r\nturtle.up()\r\nturtle.goto(0,-200)\r\nturtle.left(90)\r\nturtle.down()\r\ntree(1)\r\nturtle.exitonclick()<\/pre>\n
Mini-Datenbank:<\/strong> f\u00fcr die Bin\u00e4re Suche<\/p>\n
dbListe = [["Staat", "Lebenserwartung", "MioEinwohner", "Fertilitaet"]\r\n,["aegypten", 72.7, 97, 3.4]\r\n,["aequatorialguinea", 64.2, 1.2, 4.9]\r\n,["aethiopien", 62.2, 107.5, 4.4]\r\n,["afghanistan", 51.3, 36.5, 4.8]\r\n,["albanien", 78.3, 2.9, 1.7]\r\n,["algerien", 76.8, 42.7, 3.1]\r\n,["andorra", 82.8, 0.07, 1.3]\r\n,["angola", 56.0, 25.8, 6.0]\r\n,["antigua", 76.5, 0.09, 2.3]\r\n,["argentinien", 77.1, 44.5, 2.3]\r\n,["armenien", 74.6, 3, 1.6]\r\n,["aserbaidschan", 72.5, 9.8, 2.1]\r\n,["australien", 82.2, 24.3, 1.8]\r\n,["bahamas", 72.4, 0.3, 2.0]\r\n,["bahrain", 78.9, 1.3, 2.1]\r\n,["bangladesch", 73.2, 166.4, 2.1]\r\n,["barbados", 75.3, 0.2, 1.5]\r\n,["belgien", 81, 11.3, 1.7]\r\n,["belize", 68.7, 0.3, 2.5]\r\n,["benin", 61.9, 11.1, 5.3]\r\n,["bhutan", 70.1, 0.8, 2.1]\r\n,["bolivien", 69.2, 10.8, 3]\r\n,["bosnien", 76.7, 3.8, 1.3]\r\n,["botswana", 54.5, 2.3, 2.8]\r\n,["brasilien", 73.8, 209.4, 1.7]\r\n,["brunei", 77.2, 0.4, 1.9]\r\n,["bulgarien", 74.5, 7, 1.5]\r\n,["burkinafaso", 55.5, 18.6, 5.7]\r\n,["burundi", 60.5, 10.5, 6.1]\r\n,["chile", 78.8, 18.1, 1.9]\r\n,["china", 75.5, 1393.8, 1.8]\r\n,["costarica", 78.6, 4.8, 1.8]\r\n,["daenemark", 79.4, 5.6, 1.7]\r\n,["deutschland", 80.7, 82.8, 1.6]\r\n,["dominica", 77, 0.07, 3]\r\n,["dominikanische", 78.1, 10.6, 2.4]\r\n,["dschibuti", 63.2, 0.9, 3.2]\r\n,["ecuador", 76.8, 16.3, 2.5]\r\n,["elfenbeinkueste", 58.7, 23.2, 4.9]\r\n,["elsalvador", 74.7, 6.1, 2]\r\n,["emirate", 77.5, 9.2, 1.8]\r\n,["eritrea", 64.9, 5.3, 4.2]\r\n,["estland", 76.7, 1.3, 1.7]\r\n,["fidschi", 72.7, 0.8, 2.7]\r\n,["finnland", 80.9, 5.5, 1.6]\r\n,["frankreich", 81.9, 65.1, 1.9]\r\n,["gabun", 52.1, 2, 4.1]\r\n,["gambia", 64.9, 2, 5.6]\r\n,["georgien", 76.2, 3.9, 1.7]\r\n,["ghana", 66.6, 28, 4.2]\r\n,["grenada", 74.3, 0.1, 2.1]\r\n,["grenadinen", 75.3, 0.1, 2]\r\n,["griechenland", 80.5, 10.9, 1.3]\r\n,["grossbritannien", 80.7, 66.4, 1.8]\r\n,["guatemala", 72.3, 16.6, 3.1]\r\n,["guinea", 60.6, 12.4, 5.1]\r\n,["guineabissau", 50.6, 1.8, 5.6]\r\n,["guyana", 68.4, 0.7, 2.3]\r\n,["haiti", 63.8, 10.8, 3.2]\r\n,["honduras", 71.1, 8.1, 2.5]\r\n,["hongkong", 82.9, 7.3, 1.2]\r\n,["indien", 68.5, 1371.3, 2.3]\r\n,["indonesien", 72.7, 265.2, 2.4]\r\n,["irak", 74.9, 40.2, 4.1]\r\n,["iran", 71.4, 81.6, 2]\r\n,["irland", 80.8, 4.7, 1.9]\r\n,["island", 83, 0.3, 1.8]\r\n,["israel", 82.4, 8.1, 3.1]\r\n,["italien", 82.2, 60.6, 1.3]\r\n,["jamaika", 73.6, 2.8, 2]\r\n,["japan", 85, 126.5, 1.4]\r\n,["jemen", 65.5, 27.4, 4.2]\r\n,["jordanien", 74.6, 7.7, 3.5]\r\n,["kambodscha", 64.5, 15.8, 2.6]\r\n,["kamerun", 58.5, 23.9, 4.9]\r\n,["kanada", 81.9, 37.2, 1.5]\r\n,["kapverde", 72.1, 0.5, 2.3]\r\n,["kasachstan", 70.8, 17.8, 2.6]\r\n,["katar", 78.7, 2.2, 2]\r\n,["kenia", 64, 51, 3.9]\r\n,["kirgisistan", 70.7, 6, 2.5]\r\n,["kiribati", 66.2, 0.1, 4.2]\r\n,["kolumbien", 75.7, 49.8, 2]\r\n,["komoren", 64.2, 0.8, 3.8]\r\n,["kongo", 57.3, 84.3, 6.3]\r\n,["kroatien", 75.9, 4.2, 1.5]\r\n,["kuba", 78.7, 11.5, 1.5]\r\n,["kuwait", 78, 4, 2.1]\r\n,["laos", 64.3, 6.9, 3]\r\n,["lesotho", 53, 2.1, 3.2]\r\n,["lettland", 74.5, 1.9, 1.6]\r\n,["libanon", 77.6, 6, 1.7]\r\n,["liberia", 59, 4.6, 4.9]\r\n,["libyen", 76.5, 6.3, 2.6]\r\n,["liechtenstein", 81.9, 0.03, 1.4]\r\n,["litauen", 74.9, 2.8, 1.6]\r\n,["lucia", 77.8, 0.1, 1.7]\r\n,["luxemburg", 82.3, 0.5, 1.7]\r\n,["macau", 84.5, 0.5, 0.9]\r\n,["madagaskar", 65.9, 24.9, 4.3]\r\n,["malawi", 61.2, 17.7, 6.3]\r\n,["malaysia", 75, 32.5, 1.9]\r\n,["malediven", 75.6, 0.3, 2]\r\n,["mali", 55.8, 18.1, 6]\r\n,["malta", 80.4, 0.4, 1.3]\r\n,["marokko", 76.9, 35.2, 2.2]\r\n,["marshallinseln", 73.1, 0.05, 4.9]\r\n,["mauretanien", 63, 4.1, 4.3]\r\n,["mauritius", 75.6, 1.2, 1.4]\r\n,["mazedonien", 76.2, 2, 1.5]\r\n,["mexiko", 75.9, 130.8, 2.2]\r\n,["mikronesien", 72.9, 0.5, 2.4]\r\n,["moldau", 70.7, 4, 1.3]\r\n,["mongolei", 69.6, 3, 3.1]\r\n,["mosambik", 53.3, 28.7, 5.9]\r\n,["myanmar", 66.6, 53.9, 2.3]\r\n,["namibia", 63.6, 2.5, 3.6]\r\n,["nauru", 67.1, 0.01, 3.4]\r\n,["nepal", 70.7, 29.7, 2.3]\r\n,["neuguinea", 67.2, 7.7, 4]\r\n,["neuseeland", 81.2, 4.5, 2]\r\n,["nevis", 75.7, 0.05, 2.3]\r\n,["nicaragua", 73.2, 6.1, 2.4]\r\n,["niederlande", 81.3, 16.9, 1.7]\r\n,["niger", 55.5, 20.7, 7.6]\r\n,["nigeria", 53.4, 195.9, 5.5]\r\n,["nordkorea", 70.4, 25.2, 2.1]\r\n,["norwegen", 81.8, 5.2, 1.7]\r\n,["oesterreich", 81.5, 8.5, 1.5]\r\n,["oman", 75.5, 4.6, 2.9]\r\n,["osttimor", 68.1, 1.2, 5.7]\r\n,["pakistan", 67.7, 200.6, 3.1]\r\n,["palaestina", 73.9, 4.7, 4.1]\r\n,["palau", 73.1, 0.02, 2.1]\r\n,["panama", 78.6, 3.9, 2.5]\r\n,["paraguay", 77.2, 6.7, 2.6]\r\n,["peru", 73.7, 32.2, 2.4]\r\n,["philippinen", 69.2, 107, 2.7]\r\n,["polen", 77.6, 38.4, 1.4]\r\n,["polynesien", 77.2, 0.2, 2.2]\r\n,["portugal", 79.3, 10.3, 1.4]\r\n,["principe", 64.9, 0.1, 4.4]\r\n,["ruanda", 60.1, 11.9, 4.2]\r\n,["rumaenien", 75.1, 19.3, 1.3]\r\n,["russland", 70.3, 147.3, 1.6]\r\n,["salomonen\u00a0", 75.3, 0.5, 3.7]\r\n,["sambia", 52.5, 16.7, 5.3]\r\n,["samoa", 73.7, 0.1, 3.8]\r\n,["sanmarino", 83.3, 0.03, 1.2]\r\n,["saudiarabien", 75.3, 33.4, 2.4]\r\n,["schweden", 82.1, 9.8, 1.8]\r\n,["schweiz", 82.6, 8.3, 1.5]\r\n,["senegal", 61.7, 15.5, 5]\r\n,["serbien", 75.5, 8.8, 1.6]\r\n,["seychellen", 74.7, 0.09, 2.1]\r\n,["sierraleone", 58.2, 7.4, 5.1]\r\n,["simbabwe", 58, 15.9, 4]\r\n,["singapur", 85, 5.6, 1.2]\r\n,["slowakei", 77.1, 5.4, 1.4]\r\n,["slowenien", 78.1, 2, 1.6]\r\n,["somalia", 52.4, 14.3, 6.4]\r\n,["spanien", 81.7, 46.7, 1.3]\r\n,["srilanka", 76.8, 20.8, 2.1]\r\n,["sudan", 64.1, 41.7, 4.7]\r\n,["suedafrika", 63.1, 57.7, 2.4]\r\n,["suedkorea", 82.4, 51.8, 1.1]\r\n,["suriname", 72.2, 0.5, 2.4]\r\n,["swasiland", 51.6, 1.3, 3.3]\r\n,["syrien", 68.4, 18.5, 2.7]\r\n,["tadschikistan", 67.7, 8.6, 3.3]\r\n,["taiwan", 80.1, 23.3, 1.1]\r\n,["tansania", 62.2, 59.1, 5.2]\r\n,["thailand", 74.7, 66.2, 1.5]\r\n,["togo", 65, 7.4, 4.1]\r\n,["tonga", 76.2, 0.1, 3.6]\r\n,["trinidad", 72.9, 1.3, 1.7]\r\n,["tschad", 50.2, 14.4, 6.4]\r\n,["tschechien", 78.6, 10.5, 1.6]\r\n,["tuerkei", 74.8, 81.3, 2.1]\r\n,["tunesien", 76.1, 11.3, 2]\r\n,["turkmenistan", 70.1, 5.4, 2.4]\r\n,["tuvalu", 66.5, 0.01, 3.7]\r\n,["uganda", 55.4, 44.1, 5.4]\r\n,["ukraine", 71.8, 42.3, 1.3]\r\n,["ungarn", 75.9, 9.8, 1.4]\r\n,["uruguay", 77.2, 3.4, 1.9]\r\n,["usa", 79.8, 328, 1.8]\r\n,["usbekistan", 73.8, 32.9, 2.5]\r\n,["vanuatu", 73.4, 0.2, 3.8]\r\n,["venezuela", 75.8, 31.8, 2.4]\r\n,["vietnam", 73.4, 94.7, 2.1]\r\n,["weissrussland", 72.7, 9.4, 1.8]\r\n,["westsahara", 63, 0.5, 2.9]\r\n,["zentralafrika", 52.3, 4.9, 4.4]\r\n,["zypern", 78.7, 1.1, 1.5]]<\/pre>\n
Binary Search auf der MiniDB:<\/p>\n
import MiniDB\r\ncL = MiniDB.dbListe\r\n\r\nsuchstring = "ruanda"\r\n\r\nstartindex = 0\r\nendindex = len(cL)-1\r\n\r\nwhile startindex < endindex:\r\n    mitte_index = round((endindex+startindex)\/2)\r\n\r\n    if cL[mitte_index][0] < suchstring:\r\n        startindex = mitte_index\r\n\r\n    if cL[mitte_index][0] > suchstring:\r\n        endindex = mitte_index\r\n\r\n    if cL[mitte_index][0] == suchstring:\r\n        print(mitte_index)\r\n        break<\/pre>\n
Binary-Tree Klasse:<\/p>\n
import turtle\r\n\r\nclass Node:\r\n    def __init__(self, data, tiefe, xwert, parent):\r\n        self.links = None\r\n        self.rechts = None\r\n        self.wert = data\r\n        self.tiefe = tiefe\r\n        self.xwert = xwert\r\n        self.parent = parent\r\n\r\n# ------------------------------------------------------\r\n    def printNode(self):\r\n        print(self.wert)\r\n        print(self.tiefe)\r\n        print(self.xwert)\r\n\r\n# ------------------------------------------------------\r\n    def printBaum(self):\r\n        if self.links:\r\n            self.links.printBaum()\r\n        print("wert: ", self.wert, "tiefe: ", self.tiefe, "xwert: ", self.xwert )\r\n        turtle.penup()\r\n        turtle.setpos(self.xwert*900\/pow(2,self.tiefe), -200 + self.tiefe*50)\r\n        if self.parent is not None:\r\n            turtle.pendown()\r\n            turtle.goto(self.parent.xwert*900\/pow(2,self.parent.tiefe), -200 + self.parent.tiefe*50)\r\n        turtle.setpos(self.xwert * 900 \/ pow(2, self.tiefe), -200 + self.tiefe * 50)\r\n        turtle.dot(24, (0,255,0))\r\n        turtle.setpos(self.xwert * 900 \/ pow(2, self.tiefe), -208 + self.tiefe * 50)\r\n        turtle.write(str(self.wert), False, align="center")\r\n        turtle.penup()\r\n        if self.rechts:\r\n            self.rechts.printBaum()\r\n\r\n# ------------------------------------------------------\r\n    def insert(self, einfuegewert):\r\n        if self.wert is not None:\r\n            if einfuegewert<self.wert :\r\n                if self.links is None:\r\n                    self.links = Node(einfuegewert, self.tiefe + 1, 2*self.xwert-1, self)\r\n                else:\r\n                    self.links.insert(einfuegewert)\r\n\r\n            if einfuegewert>=self.wert:\r\n                if self.rechts is None:\r\n                    self.rechts = Node(einfuegewert, self.tiefe + 1, 2*self.xwert+1, self)\r\n                else:\r\n                    self.rechts.insert(einfuegewert)\r\n\r\n        if self.wert is None:\r\n            self.wert = einfuegewert\r\n\r\n# ------------------------------------------------------\r\ndef findeWert(self, suchwert):\r\n    if suchwert < self.wert:\r\n        if self.links is None:\r\n            print("hier is nix")\r\n        return self.links.findeWert(suchwert)\r\n\r\n    if suchwert > self.wert:\r\n        if self.rechts is None:\r\n            print("hier is nix")\r\n        return self.links.findeWert(suchwert)\r\n\r\n    if suchwert == self.wert:\r\n        print("gefunden! ", self.wert)\r\n\r\n# ------------------------------------------------------\r\n\r\nimport random\r\nroot = Node(random.randint(1,100),1, 0, None)\r\n\r\ntemplist = []\r\nfor i in range(0,21):\r\n    templist.append(i)\r\n\r\nfor i in range(20):\r\n    tempindex = random.randint(0,len(templist)-1)\r\n    root.insert(templist[tempindex])\r\n    del(templist[tempindex])\r\n\r\nturtle.setup(1000,500)\r\nturtle.colormode(255)\r\nturtle.speed(100)\r\nturtle.hideturtle()\r\nroot.printBaum()\r\nturtle.exitonclick()<\/pre>\n","protected":false},"excerpt":{"rendered":"
FizzBuzz: Einstieg in Python for k in range (1,100,1): if k%3 == 0 or k%5 == 0: if k%5 !=0: print("fizz"" ", end="") if k%3 !=0: print("buzz"" ", end="") if k%3 == 0 and k%5 == 0: print("fizzbuzz"" ", end="") else: print (k," ", end="") Linear Search: mit Zufallslisten-Generator und Zeitmessung f\u00fcr die Zeitkomplexit\u00e4t import… <\/p>\n
Read more Pythonskripte Inf4St. Teil I<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":{"0":"post-332","1":"page","2":"type-page","3":"status-publish","5":"entry"},"_links":{"self":[{"href":"https:\/\/iludis.de\/index.php?rest_route=\/wp\/v2\/pages\/332","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/iludis.de\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/iludis.de\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/iludis.de\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/iludis.de\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=332"}],"version-history":[{"count":0,"href":"https:\/\/iludis.de\/index.php?rest_route=\/wp\/v2\/pages\/332\/revisions"}],"wp:attachment":[{"href":"https:\/\/iludis.de\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=332"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}