Effective Sorting Algorithms
(quick and merge sort)

Arithmetics Algorithms
(primality, GCD, LCM, modular arithmetics, quick exponentiation)

Arrays, Stacks, Queues

Binary Search

Linked Lists
(singly and doubly linked lists)

Quadratic Sorting Algorithms
(selection, insertion, and bubble sort)

String Algorithms
(substring search, polynomial hashing)

Heap and Balanced Search Trees

Search, Enumeration, and Generation of Combinatorial Objects

Dynamic Programming
(1D and 2D dynamic programming tables)

Graph Storage and Traversal
(depth and breadth first search)

Shortest paths
(Dijkstra's, Bellman–Ford, and Bellman–Ford algorithms)

Final exam

Global optimization methods
(gradient descent, simulated annealing, genetic algorithms)

Computational geometry
(lines, circles, polygons, convex hulls)