Algorithms - lectures

Lecture	Day	Topics	Slides	Lecturer
1.	18.2.	Order of growth of functions, asymptotic complexity	alg01	Berezovský
2.	25.2.	Recursion, complexity of recursive algorithms, Master theorem	alg02	Berezovský
3.	3.3.	Trees, binary trees, backtracking	alg03	Berezovský
4.	11.3.	Queue, graph, Breadth/Depth First Search	alg05	Berezovský
5.	18.3.	Array search, Binary search tree	alg06	Berezovský
6.	25.3.	AVL and B- trees	alg07	Berezovský
9.	1.4.	Sorting algorithms with complexity O(n²)	alg04	Berezovský
7.	8.4.	Sorting algorithms with complexity O(n·log(n))	alg08	Berezovský
8.	15.4.	Sorting algorithms with complexity O(n) and in higher dimensions	alg09 alg10	Berezovský
10.	22.4	Dynamic programming I	alg11 alg11b	Berezovský
11.	29.4	Dynamic programming II	alg12	Berezovský
12.	6.5	Hashing I	alg13	Berezovský
13.	13.5	Hashing II	alg14a alg14b	Berezovský
14.	20.5	Repetitions	–	Berezovský