1
Q
insertion sort, best case + worst case
A
θ(n)
θ(n^2)
2
Q
selection sort, best case + worst case
A
θ(n^2)
θ(n^2)
3
Q
bubble sort, best case + worst case
A
θ(n^2)
θ(n^2)
4
Q
merge sort, best case + worst case
A
θ(nlogn)
θ(nlogn)
5
Q
shunting yard algortihm
A
O(n)
6
Q
dictionary operations in an AVL tree
A
O(logn)
7
Q
dictionary operations in a BST
A
O(n)
best case: balanced tree omega(logn)
8
Q
A
Data Structures and Algorithms
flashcards
Decks in class (11)
# Cards
