Zusammenfassung der Ressource
Frage 1
Frage
Describe Selection Sort
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 2
Frage
Describe Insertion Sort
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 3
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 4
Frage
Describe Quick Sort
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 5
Frage
Describe Merge Sort for arrays
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 6
Frage
Describe Merge Sort for lists
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 7
Frage
Describe Counting Sort
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 8
Frage
Describe Radix Sort
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 9
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort
Frage 10
Antworten
-
WCRT Θ(n^2)
-
WCRT Θ(n log n)
-
WCRT Θ(n)
-
ACRT Θ(n log n)
-
Best possible WCRT
-
In Place
-
Run space +Θ(n)
-
Stable
-
Not Stable
-
Comparison Sort