[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B182/public/cz/predmety/43/56/p4356206.html|FEL timetable]]
[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B182/public/cz/paralelky/P43/56/par4356206.1.html|ALG students]] 
[[https://cw.felk.cvut.cz/brute/|Upload system BRUTE]]
[[https://cw.felk.cvut.cz/forum/forum-1570.html|Discussion board]]

====== Lectures ======

^ Lecture^ Day            ^  Topics         ^  Slides  ^  
|  **1.**  |  27.9. | Order of growth of functions, asymptotic complexity |{{ :courses:be5b33alg:alge01.pdf | alg01a}} \\  {{:courses:be5b33alg:lesson01_2019.pdf | alg01b}} | 
|  **2.**  |  4.10. | Recursion, complexity of recursive algorithms, Master theorem | {{ :courses:be5b33alg:alg02e.pdf | alg02}} | 
|  **3.**  |  11.10. | Trees, binary trees, backtracking     |{{ :courses:be5b33alg:alg03_2011e_py.pdf | alg03 }} |  
|  **4.**  |  18.10. | //canceled // |  |
|  **5.**  |  25.10. | //canceled//  |  |
|  **6.**  |  1.11.  | Queue, graph, Breadth/Depth First Search  | {{:courses:be5b33alg:alg04_2011exten_py.pdf| alg04_py}} |  
|  **7.**  |  8.11.  | Array search, Binary search tree              | {{ :courses:be5b33alg:alg05_2011e_py.pdf | alg05_py}} | 
|  **8.**  |  15.11. | AVL and B- trees                | {{:courses:be5b33alg:alg06_2011e.pdf|alg06 }}  |
|  **9.**  |  22.11.  | Sorting algorithms I | {{:courses:be5b33alg:alg07_2011e_py.pdf| alg07_py}} |   
|  **10.**  |  29.11. | Sorting algorithms II  | {{:courses:be5b33alg:alg08_2011e_py.pdf| alg08_py }}, {{:courses:be5b33alg:alg09_2011e_py.pdf| alg09_py }}  |    
|  **11.**  |   6.12. | Dynamic programming I       | {{:courses:be5b33alg:alg10_2015_e_py.pdf| alg10_py}} \\ {{:courses:be5b33alg:alg10_2015b_e_py.pdf| alg10b_py}} |
|  **12.**  |   13.12. | Dynamic programming II       | {{:courses:be5b33alg:alg10_2015d_e_py.pdf | alg11_py}} \\ {{:courses:be5b33alg:alg10_2015c_e_py.pdf| alg11b_py}}|   
|  **13.**  |  20.12. | Hashing I      | {{ :courses:be5b33alg:alg13e.pdf | alg12}}   | 
|  **14.**  |  10.1. | Hashing II | {{ :courses:be5b33alg:alg14e.pdf |alg13a}}  {{ :courses:be5b33alg:alg13_2015b_e.pdf | alg13b}}  | 

**Source code examples for particular lectures**

02 - {{ :courses:be5b33alg:rec.py | basic recursion }}, {{ :courses:be5b33alg:rec2.py | same examples, more insight }}

03 - {{:courses:be5b33alg:binarytree.py|  binary tree, In-pre-Post order, recursion}}, {{ :courses:be5b33alg:binarytree2.py | 
alternative: binary tree in just 1D arrays}}   ( {{ :courses:be5b33alg:alg03_2011e.ppt | slides ppt }}  {{ :courses:be5b33alg:alg03_2011e_py.ppt | slides-python pptx}} )

04 - {{:courses:be5b33alg:graph.py| graph, DFS, BFS}}

06 - {{:courses:be5b33alg:magicsquare.py| backtrack example - magic square}}

07, 08 - {{:courses:be5b33alg:sortsx2.py| Sorts - Insert, Select, Bubble, Quick, Merge, Heap, Radix, Counting}}