{"id":360,"date":"2021-01-19T11:30:00","date_gmt":"2021-01-19T10:30:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=360"},"modified":"2021-01-20T09:32:57","modified_gmt":"2021-01-20T08:32:57","slug":"vorlesung-18","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/2021\/01\/19\/vorlesung-18\/","title":{"rendered":"Vorlesung 18"},"content":{"rendered":"\n<p>In dieser Vorlesung leiten wir konkrete Laufzeitschranken f\u00fcr das Problem des Sortierens einer Liste von Zahlen her. Zudem machen wir uns Gedanken \u00fcber das L\u00f6sen von Rekursionsgleichungen.<\/p>\n\n\n\n<p>Folien: <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2021\/aud\/webpages\/skript\/VL18.pdf\">VL18.pdf<\/a><br>Notizen: <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2021\/aud\/webpages\/skript\/VL18b.pdf\">VL18b.pdf<\/a><br>Video: <a href=\"https:\/\/youtu.be\/_XLAhnqudYw\">[YouTube]<\/a>, <a href=\"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/go\/vl18_video\/\">[IBR]<\/a><\/p>\n\n\n\n<h3>Weitere Links<\/h3>\n\n\n\n<p><a href=\"https:\/\/en.wikipedia.org\/wiki\/Balance_puzzle\">Wikipedia \u00fcber W\u00e4geprobleme (engl.)<\/a><br><a href=\"https:\/\/de.wikipedia.org\/wiki\/Entscheidungsbaum\">Wikipedia \u00fcber Entscheidungsb\u00e4me<\/a><br><a href=\"http:\/\/jeffe.cs.illinois.edu\/teaching\/algorithms\/notes\/28-lowerbounds.pdf\">Ein Kapitel von Jeff Erickson \u00fcber untere Schranken<\/a><br><a href=\"https:\/\/de.wikipedia.org\/wiki\/Sortierverfahren\">Wikipedia \u00fcber Sortierverfahren (mit einem Beweis der unteren Schranke)<\/a><br><a href=\"https:\/\/en.wikipedia.org\/wiki\/Recursion\">Recursion (englisch, l\u00e4nger)<\/a><br><a href=\"https:\/\/de.wikipedia.org\/wiki\/Rekursion\">Rekursionen (deutsch)<\/a><br><a href=\"https:\/\/en.wikipedia.org\/wiki\/Generating_function\">Generating Functions (englisch, l\u00e4nger)<\/a><br><a href=\"https:\/\/de.wikipedia.org\/wiki\/Erzeugende_Funktion\">Erzeugende Funktionen (deutsch)<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>In dieser Vorlesung leiten wir konkrete Laufzeitschranken f\u00fcr das Problem des Sortierens einer Liste von Zahlen her. Zudem machen wir uns Gedanken \u00fcber das L\u00f6sen von Rekursionsgleichungen.<\/p>\n","protected":false},"author":1,"featured_media":361,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[14,19,8],"tags":[],"_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/360"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/comments?post=360"}],"version-history":[{"count":3,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/360\/revisions"}],"predecessor-version":[{"id":471,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/posts\/360\/revisions\/471"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media\/361"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media?parent=360"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/categories?post=360"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/tags?post=360"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}