Study of algorithms and their complexity. Design, analysis and evaluation of performance. Complexity theory and classes of complexity. O, Big O and Theta notation. Computational classes. Union-Find, Divide and Conquer, Greedy, Dynamic programming, Linear Programming, Search in graphs, NP-completeness.