{"id":376,"date":"2023-02-07T09:30:00","date_gmt":"2023-02-07T09:30:00","guid":{"rendered":"https:\/\/aud.ibr.cs.tu-bs.de\/?p=376"},"modified":"2023-02-08T13:37:29","modified_gmt":"2023-02-08T12:37:29","slug":"vorlesung-24","status":"publish","type":"post","link":"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-24\/","title":{"rendered":"Vorlesung 24"},"content":{"rendered":"\n

In dieser Vorlesung beenden wir das Kapitel zum Thema Sortieralgorithmen und werfen abschlie\u00dfend einen Blick auf parallelisierte Sortierverfahren. <\/p>\n\n\n\n

Folien:<\/strong> VL24.pdf<\/a>
Notizen:<\/strong>
VL24b.pdf<\/a>
Video:<\/strong>
[YouTube]<\/a>, [IBR]<\/a><\/p>\n\n\n\n

Weitere Links<\/h3>\n\n\n\n

Visualisierung einiger Sortierverfahren<\/a>
Bubblesort als ungarischer Volkstanz<\/a>
Mergesort als ungarischer Volkstanz<\/a>
Quicksort als ungarischer Volkstanz (Man beachte, dass die Vertauschungen und Pointerabfolge eine gleichwertige Variation dessen sind, was in der Vorlesung besprochen wurde.)<\/a>
The Sound of Sorting<\/a>
The Sound of Quicksort<\/a>
Roboterduell zwischen Quicksort und Bubblesort<\/a>
“What’s the best way to sort 1 million 32-bit integers?” – Barack Obama antwortet…<\/a>
Weiterf\u00fchrende \u00dcberlegungen zur Laufzeit von Spaghettisort<\/a>

Bogosort bei IDEA instructions<\/a>
Bogosort<\/a>
Bogosort (engl.)<\/a>

Coordinated Motion Planning (Forschungsvideo)<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

In dieser Vorlesung beenden wir das Kapitel zum Thema Sortieralgorithmen und werfen abschlie\u00dfend einen Blick auf parallelisierte Sortierverfahren. <\/p>\n","protected":false},"author":1,"featured_media":377,"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\/bogo-sort.png",2000,1414,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort-150x150.png",150,150,true],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort-300x212.png",300,212,true],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort-768x543.png",768,543,true],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort-1024x724.png",1024,724,true],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort-1536x1086.png",1536,1086,true],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/bogo-sort.png",2000,1414,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 beenden wir das Kapitel zum Thema Sortieralgorithmen und werfen abschlie\u00dfend einen Blick auf parallelisierte Sortierverfahren.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/376"}],"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=376"}],"version-history":[{"count":7,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/376\/revisions"}],"predecessor-version":[{"id":3493,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/376\/revisions\/3493"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/377"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=376"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=376"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=376"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}