1
Q
Insertion Sort Best-Case
A
O(n)
2
Q
Insertion Sort Worst-Case
A
O(n^2)
3
Q
Insertion Sort Average-Case
A
O(n^2)
4
Q
Running Time of Merge Sort
A
T(n) = O(n log n)
5
Q
Merge sort worst-case
A
O(n log n)
6
Q
Merge sort average case
A
O(n log n)
7
Q
Timsort worst-case
A
O(n log n)
8
Q
Timsort average-case
A
O(n log n)
9
Q
Timesort best case
A
O(n)
Sorting Algorithms
flashcards
Decks in class (6)
# Cards
