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
Folien: VL18.pdf<\/a> YouTube: Puzzle aus Brooklyn99 (engl.)<\/a> 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":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"","footnotes":""},"categories":[14,19,8],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_.png",1024,887,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_-150x150.png",150,150,true],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_-300x260.png",300,260,true],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_-768x665.png",768,665,true],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_.png",1024,887,false],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_.png",1024,887,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/1024px-Sierpinski_triangle.svg_.png",1024,887,false]},"uagb_author_info":{"display_name":"Matthias Konitzny","author_link":"https:\/\/aud.ibr.cs.tu-bs.de\/author\/konitzny\/"},"uagb_comment_info":0,"uagb_excerpt":"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.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/360"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/comments?post=360"}],"version-history":[{"count":8,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/360\/revisions"}],"predecessor-version":[{"id":3465,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/360\/revisions\/3465"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/361"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=360"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=360"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=360"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Notizen: VL18b.pdf<\/a>
Video: [YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\nWeitere Links<\/h3>\n\n\n\n
Wikipedia \u00fcber W\u00e4geprobleme (engl.)<\/a>
Wikipedia \u00fcber Entscheidungsb\u00e4me<\/a>
Ein Kapitel von Jeff Erickson \u00fcber untere Schranken<\/a>
Wikipedia \u00fcber Sortierverfahren (mit einem Beweis der unteren Schranke)<\/a>
Recursion (englisch, l\u00e4nger)<\/a>
Rekursionen (deutsch)<\/a>
Generating Functions (englisch, l\u00e4nger)<\/a>
Erzeugende Funktionen (deutsch)<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"