FEL timetable ALG students Upload system BRUTE Discussion board
Lecture | Day | Topics | Slides |
---|---|---|---|
1. | 27.9. | Order of growth of functions, asymptotic complexity | alg01a alg01b |
2. | 4.10. | Recursion, complexity of recursive algorithms, Master theorem | alg02 |
3. | 11.10. | Trees, binary trees, backtracking | alg03 |
4. | 18.10. | canceled | |
5. | 25.10. | canceled | |
6. | 1.11. | Queue, graph, Breadth/Depth First Search | alg04_py |
7. | 8.11. | Array search, Binary search tree | alg05_py |
8. | 15.11. | AVL and B- trees | alg06 |
9. | 22.11. | Sorting algorithms I | alg07_py |
10. | 29.11. | Sorting algorithms II | alg08_py , alg09_py |
11. | 6.12. | Dynamic programming I | alg10_py alg10b_py |
12. | 13.12. | Dynamic programming II | alg11_py alg11b_py |
13. | 20.12. | Hashing I | alg12 |
14. | 10.1. | Hashing II | alg13a alg13b |
Source code examples for particular lectures
02 - basic recursion , same examples, more insight
03 - binary tree, In-pre-Post order, recursion, alternative: binary tree in just 1D arrays ( slides ppt slides-python pptx )
04 - graph, DFS, BFS
06 - backtrack example - magic square
07, 08 - Sorts - Insert, Select, Bubble, Quick, Merge, Heap, Radix, Counting