Sorting Algorithms Flashcards
1
Q
Best Case Big O runtime for Insertion sort
A
O(N)
2
Q
Best Case Big O runtime for Quick sort
A
O(NlogN)
3
Q
Best Case Big O runtime for Bubble sort
A
O(N)
4
Q
Best Case Big O runtime for Selection sort
A
O(N^2)
5
Q
Best Case Big O runtime for Merge sort
A
O(NlogN)
6
Q
Average Case Big O runtime for Insertion sort
A
O(N^2)
7
Q
Average Case Big O runtime for Quick sort
A
O(NlogN)
8
Q
Average Case Big O runtime for Bubble sort
A
O(N^2)
9
Q
Average Case Big O runtime for Selection sort
A
O(N^2)
10
Q
Average Case Big O runtime for Merge sort
A
O(NlogN)
11
Q
Worst Case Big O runtime for Insertion sort
A
O(N^2)
12
Q
Worst Case Big O runtime for Quick sort
A
O(N^2)
13
Q
Worst Case Big O runtime for Bubble sort
A
O(N^2)
14
Q
Worst Case Big O runtime for Selection sort
A
O(N^2)
15
Q
Worst Case Big O runtime for Merge sort
A
O(NlogN)
