Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
programming_i_2018-19_winter_semester [2018/10/12 14:50]
jakub.gemrot [Lab 01]
programming_i_2018-19_winter_semester [2018/10/16 21:13]
jakub.gemrot
Line 58: Line 58:
  
 ======Labs History====== ======Labs History======
 +
 +==== Lab 03 ====
 +  * **16.10.2018**
 +  * We talked about time complexity of algorithms, we touched Big-O notation ([[https://cs.wikipedia.org/wiki/Landauova_notace|Landau Notation]])
 +  * I've failed to show you the correct computation of the lower bound for sorting, which we will fix next week
 +  * No homeworks folks! Yay! Finish the ones from previous weeks :-)
  
 ==== Lab 02 ==== ==== Lab 02 ====
programming_i_2018-19_winter_semester.txt · Last modified: 2019/01/25 16:16 by jakub.gemrot