Insertion/Merge Sort Flashcards

1
Q

Insertion Sort Best-Case

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Insertion Sort Worst-Case

A

O(n^2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Insertion Sort Average-Case

A

O(n^2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Running Time of Merge Sort

A

T(n) = O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Merge sort worst-case

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Merge sort average case

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Timsort worst-case

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Timsort average-case

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Timesort best case

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly