Asymptotic comparison of algorithms: main complexity classes. Use of tree structures for search and sorting: binary trees and BSTs, balanced trees, heaps. Examples of advanced algorithms: integer and matrix multiplication, and exponentiation. Complexity theorem of recursive divide-and-conquer algorithms.

TDs

TPs