Sorting algorithms - Complexities Flashcards
1
Q
Binary Search - Best case complexity
A
O(1)
2
Q
Binary Search - Best case scenario
A
Target value in middle of array
3
Q
Binary Search - Worst case complexity
A
O(log(N))
4
Q
Binary Search - Worst case scenario
A
Target value either at very start or end of array
5
Q
Insertion Sort - Best case complexity
A
O(N)
6
Q
Insertion Sort - Best case scenario
A
Already sorted
7
Q
Insertion Sort - Worst case complexity
A
O(N^2)
8
Q
Insertion Sort - Worst case scenario
A
Reverse order (Element i > i+1)
9
Q
Selection Sort - Best case complexity
A
O(N^2)
10
Q
Selection Sort - Best case scenario
A
N/A
11
Q
Selection Sort - Worst case complexity
A
O(N^2)
12
Q
Selection Sort - Worst case scenario
A
N/A
13
Q
Merge Sort - Best case complexity
A
O(N log(N))
14
Q
Merge Sort - Best case scenario
A
N/A
15
Q
Merge Sort - Worst case complexity
A
O(N log(N))
