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

====== Algorithms - lectures ======

^ Lecture^ Day            ^  Topics         ^  Slides  ^   Lecturer  ^
|  **1.**  |  24.2. | Order of growth of functions, asymptotic complexity    |{{:courses:ae4b33alg:alge01.pdf| alg01a}}  {{:courses:be5b33alg:lesson01_2006pube.pdf| alg01b}} | Berezovský  |
|  **2.**  |   2.3. | Recursion, complexity of recursive algorithms, Master theorem |{{:courses:ae4b33alg:alg02e.pdf| alg02}} | Berezovský  |
|  **3.**  |   9.3. | Trees, binary trees, backtracking     | {{:courses:ae4b33alg:alg03_2011e.pdf| alg03}} | Berezovský  | 
|  **4.**  |  16.3. | Queue, graph, Breadth/Depth First Search  | {{:courses:ae4b33alg:alg04_2011e.pdf| alg04}} \\ {{:courses:be5b33alg:alg04_2011exten_py.pdf| alg04_py}} | Berezovský  | 
|  **5.**  |  23.3. | Array search, Binary search tree              | {{:courses:ae4b33alg:alg05_2011e.pdf| alg05}} \\ {{:courses:be5b33alg:alg05_2011e_py.pdf| alg05_py}}  | Berezovský  |
|  **6.**  |  30.3. | AVL and B- trees                | {{:courses:be5b33alg:alg06_2011e.pdf|alg06 }}  | Berezovský  | 
|  **7.**  |   6.4.  | Sorting algorithms with complexity O(n²) | {{:courses:ae4b33alg:alg07_2011e.pdf| alg07 }} \\ {{:courses:be5b33alg:alg07_2011e_py.pdf| alg07_py}} | Berezovský  |
|  **8.**  |  13.4. | Sorting algorithms with complexity O(n·log(n)) | {{:courses:ae4b33alg:alg08_2011e.pdf| alg08}} \\ {{:courses:be5b33alg:alg08_2011e_py.pdf| alg08_py }}| Berezovský   | 
|  **9.**  |  20.4.  | Sorting algorithms with  complexity O(n) | {{:courses:ae4b33alg:alg09_2011e.pdf  | alg09}}  {{:courses:be5b33alg:alg09_2011e_py.pdf| alg09_py }}  | Berezovský     | 
|  **10.**  |  27.4 | Dynamic programming I           | {{:courses:ae4b33alg:alg10_2015_e.pdf| alg10 }} \\ {{:courses:be5b33alg:alg10_2015_e_py.pdf| alg10_py}} \\ {{:courses:be5b33alg:alg10_2015b_e.pdf| alg10b }} \\ {{:courses:be5b33alg:alg10_2015b_e_py.ppt| alg10b_py }} \\ {{:courses:be5b33alg:alg10_2015b_e_py.pdf| alg10b_py}} | Berezovský  |
|  **11.**  |   4.5 | Dynamic programming II             |{{:courses:be5b33alg:alg10_2015c_e_py.ppt|  alg11_py }} \\ {{:courses:be5b33alg:alg10_2015c_e_py.pdf| alg11_py}}| Berezovský  |
|  **12.**  |   11.5 | Hashing I             | {{:courses:ae4b33alg:alg13e.pdf| alg12 }}  |  Berezovský  |
|  **13.**  |  18.5 | Hashing II | {{:courses:ae4b33alg:alg14e.pdf| alg13a}} {{:courses:ae4b33alg:alg13_2015b_e.pdf| alg13b}}    | Berezovský  |
|  **14.**  |  25.5 | Sorts in more dimensions | {{:courses:ae4b33alg:alg10_2011e.pdf| alg09 }}   | Berezovský  | 

**Source code examples for particular lectures**

03 - {{:courses:be5b33alg:binarytree.py|  binary tree, In-pre-Post order, recursion}}

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}}