Sortieren (VL 06-08) Flashcards
1
Q
InsertionSort Worst-Case
A
Θ(n²)
2
Q
InsertionSort Average-Case
A
Θ(n²)
3
Q
InsertionSort Stabil
A
Ja
4
Q
BubbleSort Worst-Case
A
Θ(n²)
5
Q
BubbleSort Average-Case
A
Θ(n²)
6
Q
BubbleSort Stabil
A
Ja
7
Q
QuickSort Worst-Case
A
Θ(n²)
8
Q
QuickSort Average-Case
A
Θ(n · log n)
9
Q
QuickSort Stabil
A
Nein
10
Q
MergeSort Worst-Case
A
Θ(n · log n)
11
Q
MergeSort Average-Case
A
Θ(n · log n)
12
Q
MergeSort Stabil
A
Ja
13
Q
HeapSort Worst-Case
A
Θ(n · log n)
14
Q
HeapSort Average-Case
A
Θ(n · log n)
15
Q
HeapSort Stabil
A
Nein
