1
Q
list polynomial and more time complexity
A
O(n^2)
O(k^n)
O(n!)
2
Q
time complexity of
binary search
A
O(log n)
3
Q
time complexity of
bubble sort
A
O(n^2)
for …
for ….
4
Q
time complexity of
linear search
A
O(n)
5
Q
time complexity of
merge sort
A
O(n log n)
CS A Level Paper 1
flashcards
Decks in class (7)
# Cards
