Big O Notation Time Complexity Worst Case Flashcards

1
Q

Insertion Sort

A

O(n^2)

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

Selection Sort

A

O(n^2)

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

Smooth Sort

A

O(nlogn)

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

Bubble Sort

A

O(n^2)

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

Shell Sort

A

O(nlogn^2)

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

Mergesort

A

O(nlogn)

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

Quicksort

A

O(nlogn)

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

Heapsort

A

O(nlogn)

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