08_Vorlesung_13_Dez_2007

08_Vorlesung_13_Dez_2007 - Datenstrukturen &...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
13.12.2007 helmut.hauser@IGI Algorithmen VO 708.031 8. Vorlesung, am 13.Dez. 2007
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
13.12.2007 helmut.hauser@IGI Wiederholung - Quicksort T(n) = T(k) + T(n-k) + O(n) Bester Fall: Schlechtester Fall: k = n/2 k = 1 Minimale Rekursionstiefe Maximale Rekursionstiefe best case : O(n log n) worst case: O(n 2 ) Wahrscheinlichkeit = 1/(n!)
Background image of page 2
13.12.2007 helmut.hauser@IGI Randomisierter Quicksort k = 1, 2, 3 …. (n-1), n average case: O(n log n) Zu erwartende Laufzeit (average case): Durchschnittliche Performance des Algorithmus – Summe der Laufzeiten zu allen möglichen Inputs gewichtet nach deren Auftrittswahrscheinlichkeit. worst case kann immer noch auftreten!!
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
helmut.hauser@IGI Quicksort Bestes Sortierverfahren ? Best Case: T(n) = O(n log n) Worst Case: T(n) = O(n 2 ) Average Case: T(n) = O(n log n) Verbesserungen: - Median-of-3 Pivot - Randomisierte Version - Ab kleinen n Æ insertion sort Schlüsselrolle: Pivotelement Anwendungen… ..dürfen nicht kritisch sein ! (Medizin, Raumfahrt,
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/19/2009 for the course HKJLHKJL 565 taught by Professor Fhfh during the Spring '09 term at University of Graz.

Page1 / 13

08_Vorlesung_13_Dez_2007 - Datenstrukturen &...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online