[[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]]

====== ALG - Links ======
(//Students fluent in Czech may also want to check the additional [[courses:a4b33alg:literatura_odkazy| Czech links ]] in ALG subject//.)

===== Online =====

**Interactive data structures** \\

  * [[https://www.cs.usfca.edu/~galles/visualization/Algorithms.html| Easy visualization ]]

===== Books =====

  * [**CLRS**] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, 3rd ed., MIT Press, 2009,  [[http://en.wikipedia.org/wiki/Introduction_to_Algorithms| link]] \\
''Standard worldwide used textbook, voluminous (1200+ pages) and detailed.''\\ 

  * [**DPV**] S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani: Algorithms,  Mcgraw-Hill Higher Education, 2006, [[http://www.amazon.de/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ref=sr_1_1?ie=UTF8&qid=1345655823&sr=8-1|link]] \\
''Excellent textbook contains many important exercises, easily readable and written with minimum "academical" formalism.  \\ In pdf: [[http://www.cs.berkeley.edu/~vazirani/algorithms.html | Link ]]. ''\\


  * [**AC**]  Robert Sedgewick: Algorithms in C, part 1-4, Addison-Wesley, 2001 \\
''Another worldwide used textbook concerned mainly with sorting and searching. Contains very detailed and simultaneously approachable analysis of all algorithms, many pictures and examples. [[http://www.informit.com/store/algorithms-in-c-parts-1-4-fundamentals-data-structures-9780201314526| Link]]. ''\\
 

  * [**ACG**] Robert Sedgewick: Algorithms in C, Part 5: Graph Algorithms (3rd Edition), Addison-Wesley Professional, 2002 \\
''Continuation of [AC]. Graph representations, graph searching, shortest paths, minimum spanning trees, network flows, directed graphs. This book, similarly as [AC], stresses also important implementation issues. 528 pages. [[http://www.informit.com/store/algorithms-in-c-part-5-graph-algorithms-9780201316636| Link]].
'' \\

  * Both [**AC**] and [**ACG**] are available in equivalent C++ and Java mutations.\\

  * [**PG**] A collection of elementary computer science problems [[http://larc.unt.edu/ian/books/free/poa.pdf| Parberry, Gasarch: Problems on Algorithms]]

===== Programming Probems ===== 

  * ACM Programming Contest archive [[https://icpcarchive.ecs.baylor.edu/|ACM-ICPC Live Archive]] contains about 5000 original contest problems.

  * University of Valladolid: [[http://uva.onlinejudge.org/| UVA Online Judge]],  UVA Toolkit [[http://uvatoolkit.com/problemssolve.php|UVA problems classification by topics]]

  * SPOJ [[http://www.spoj.com/|Sphere Online Judge]] Over 13000 problems of various levels, [[http://vnoi.info/index.php?option=com_voj&task=classify&site=spoj| some SPOJ problems classification by topics 1]] a [[http://problemclassifier.appspot.com/|some SPOJ problems classification by topics 2]]

  * [[http://www.codechef.com/|Codechef]] You can see and check the code of other successful members. Very useful.

  * [[http://codeforces.com/|Codeforces]]

  * [[http://projecteuler.net/problems| Project Euler]]. Top quality problems from the borders between programming and math, at least about first 100 problems can be recommended to anybody striving to become a good programmer. 

===== DP =====
http://www.codechef.com/wiki/tutorial-dynamic-programming

chapter 6 of [**DPV**] http://www.cs.berkeley.edu/~vazirani/algorithms/chap6.pdf

http://people.cs.clemson.edu/~bcdean/dp_practice/

http://www.geeksforgeeks.org/tag/dynamic-programming/

https://www.hackerrank.com/domains/algorithms/dynamic-programming

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114