{"id":357,"date":"2023-01-11T11:15:00","date_gmt":"2023-01-11T11:15:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=357"},"modified":"2022-12-20T10:43:46","modified_gmt":"2022-12-20T09:43:46","slug":"vorlesung-17","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-17\/","title":{"rendered":"Vorlesung 17"},"content":{"rendered":"\n<p>In dieser Vorlesung geben wir eine Einf\u00fchrung in das Oberthema Sortieren. Wir stellen au\u00dferdem einen Sortieralgorithmus mit dem Namen Mergesort vor und stellen grundlegende \u00dcberlegungen zur Laufzeit von Sortieralgorithmen an.<\/p>\n\n\n\n<p>Folien: <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/skript\/VL17.pdf\">VL17.pdf<\/a><br>Notizen: <a href=\"https:\/\/www.ibr.cs.tu-bs.de\/courses\/ws2223\/aud\/skript\/VL17b.pdf\">VL17b.pdf<\/a><br>Video: <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/go\/vl17_yt\/\" target=\"_blank\">[YouTube]<\/a>, <a rel=\"noreferrer noopener\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/index.php\/go\/vl17_video\/\" target=\"_blank\">[IBR]<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Literatur<\/h3>\n\n\n\n<p>Goodrich\/Tamassia &#8211; Data Structures and Algorithms in Java <a href=\"http:\/\/enos.itcollege.ee\/~jpoial\/algorithms\/GT\/Data%20Structures%20and%20Algorithms%20in%20Java%20Fourth%20Edition.pdf\">Elektronische Ausgabe der 4. Auflage; hier: Kapitel 11.1, Seiten 678ff.<\/a><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Weitere Links<\/h3>\n\n\n\n<p><a href=\"http:\/\/de.wikipedia.org\/wiki\/Mergesort\">Wikipedia \u00fcber Mergesort<\/a><br><a href=\"https:\/\/idea-instructions.com\/merge-sort\/\">Merge S\u00f6rt bei Idea Instructions<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>In dieser Vorlesung geben wir eine Einf\u00fchrung in das Oberthema Sortieren. Wir stellen au\u00dferdem einen Sortieralgorithmus mit dem Namen Mergesort vor und stellen grundlegende \u00dcberlegungen zur Laufzeit von Sortieralgorithmen an.<\/p>\n","protected":false},"author":1,"featured_media":358,"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,18],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert.png",1232,654,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert-150x150.png",150,150,true],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert-300x159.png",300,159,true],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert-768x408.png",768,408,true],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert-1024x544.png",1024,544,true],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert.png",1232,654,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/mergesoert.png",1232,654,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 geben wir eine Einf\u00fchrung in das Oberthema Sortieren. Wir stellen au\u00dferdem einen Sortieralgorithmus mit dem Namen Mergesort vor und stellen grundlegende \u00dcberlegungen zur Laufzeit von Sortieralgorithmen an.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/357"}],"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=357"}],"version-history":[{"count":7,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/357\/revisions"}],"predecessor-version":[{"id":3464,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/357\/revisions\/3464"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/358"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=357"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=357"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=357"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}