Algorithms Complexity Flashcards
1
Q
Quicksort Average
A
O(N logN)
2
Q
Mergesort Average
A
O(N logN)
3
Q
Insertion Sort Average
A
O(N^2)
4
Q
Insertion Sort Best
A
O(N)
5
Q
Quicksort Best
A
O(N logN)
6
Q
Mergesort Best
A
O(N logN)
7
Q
Rabin Karp Substring Search Best Case
A
O(M+N)
8
Q
KMP Substring Search
A
O(M+N)
9
Q
Rabing Karp Substring Search Worst Case
A
O(MN)
10
Q
Breadth First Search Time Complexity
A
O(V+E)
11
Q
Breadth First Search Space Complexity
A
O(V)
12
Q
Depth First Search Time Complexity
A
O(V+E)
13
Q
Depth First Search Space Complexity
A
O(V)
14
Q
Bubble Sort
A
O(N^2)
15
Q
Insertion Sort
A
O(N^2)
