In dieser \u00dcbung schauen wir uns noch einmal das Sortierverfahren Mergesort an, leiten die Laufzeit her und betrachten auch noch mal das Mastertheorem. Zum Abschluss gibt es dann noch einen neuen Sortier-Algorithmus: Heapsort.<\/p>\n\n\n\n
Folien: U7.pdf<\/a> In dieser \u00dcbung schauen wir uns noch einmal das Sortierverfahren Mergesort an, leiten die Laufzeit her und betrachten auch noch mal das Mastertheorem. Zum Abschluss gibt es dann noch einen neuen Sortier-Algorithmus: Heapsort.<\/p>\n","protected":false},"author":1,"featured_media":480,"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":[6,14,19,18],"tags":[],"uagb_featured_image_src":{"full":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag.png",1147,538,false],"thumbnail":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag-150x150.png",150,150,true],"medium":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag-300x141.png",300,141,true],"medium_large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag-768x360.png",768,360,true],"large":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag-1024x480.png",1024,480,true],"1536x1536":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag.png",1147,538,false],"2048x2048":["https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/01\/U6_Beitrag.png",1147,538,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 \u00dcbung schauen wir uns noch einmal das Sortierverfahren Mergesort an, leiten die Laufzeit her und betrachten auch noch mal das Mastertheorem. Zum Abschluss gibt es dann noch einen neuen Sortier-Algorithmus: Heapsort.","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/523"}],"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=523"}],"version-history":[{"count":5,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/523\/revisions"}],"predecessor-version":[{"id":3486,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/posts\/523\/revisions\/3486"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media\/480"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=523"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/categories?post=523"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/tags?post=523"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Video: [YouTube]<\/a>, [IBR]<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"