NHH Code

1. Running Time and Basic Data Structures

We give a brief introduction into running time analysis along with a table of feasible running times for a 1 second time limit. We then discuss some fundamental data structures and the performance of their basic operations: lists (incl. applications of sorting), sets, doubly-ended queues, and heaps.

Practice problems: list sorting set deque heap

2. Brute Force

We consider several ways of enumerating all possibilities, which is feasible for small-enough inputs. We discuss nested loops for enumerating tuples of small dimensions, methods for enumerating all subsets and all permutations. We briefly touch on bitmasks as an efficient representation of small sets.

Practice problems: brute-force (all) nested-loops bitmask subset permutation