Warning
This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

FEL timetable ALG students Upload system BRUTE Discussion board

Algorithms - lectures

Lecture Day Topics Slides Lecturer
1. 24.2. Order of growth of functions, asymptotic complexity alg01a alg01b Berezovský
2. 2.3. Recursion, complexity of recursive algorithms, Master theorem alg02 Berezovský
3. 9.3. Trees, binary trees, backtracking alg03 Berezovský
4. 16.3. Queue, graph, Breadth/Depth First Search alg04
alg04_py 		Berezovský
5. 23.3. Array search, Binary search tree alg05
alg05_py 		Berezovský
6. 30.3. AVL and B- trees alg06 Berezovský
7. 6.4. Sorting algorithms with complexity O(n²) alg07
alg07_py 		Berezovský
8. 13.4. Sorting algorithms with complexity O(n·log(n)) alg08
alg08_py 		Berezovský
9. 20.4. Sorting algorithms with complexity O(n) alg09 alg09_py Berezovský
10. 27.4 Dynamic programming I alg10
alg10_py
alg10b
alg10b_py
alg10b_py 		Berezovský
11. 4.5 Dynamic programming II alg11_py
alg11_py		 Berezovský
12. 11.5 Hashing I alg12 Berezovský
13. 18.5 Hashing II alg13a alg13b Berezovský
14. 25.5 Sorts in more dimensions alg09 Berezovský

Source code examples for particular lectures

03 - binary tree, In-pre-Post order, recursion

04 - graph, DFS, BFS

06 - backtrack example - magic square

07, 08 - Sorts - Insert, Select, Bubble, Quick, Merge, Heap, Radix, Counting

courses/be5b33alg/lectures.txt · Last modified: 2017/05/03 14:28 by berezovs