This module continues ASD1 and ASD2. It covers:
Measuring algorithm performance/efficiency
Main search and sorting algorithms, compared by complexity
Tree data structures: representations, types, and applications
Hash tables
Prerequisites: Solid knowledge of basic algorithms/programming and basic data structures (arrays, linked lists, stacks, queues).
