Notes / Section 5
Algorithms
Asymptotic complexity
Asymptotic worst case time and space complexity.
Searching and sorting
Searching, sorting.
Hashing
Hashing.
Greedy algorithms
Greedy design technique.
Dynamic programming
Dynamic programming.
Divide and conquer
Divide-and-conquer.
Graph traversals, MST and shortest paths
Graph traversals, minimum spanning trees, shortest paths.