Trace:

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 		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/23 20:52]
jakub.gemrot
Line 58: Line 58:
  
 ======Labs History====== ======Labs History======
 +
 +==== Lab 04 ====
 +  * **23.10.2018**
 +  * So we have presented correct lower-estimate for sorting algorithms based on comparison of two numbers, yep O(N log N) is the best we can hope for
 +  * But only for a given assumptions, see [[https://cs.wikipedia.org/wiki/Counting_sort|Counting Sort]], for small range of natural numbers, you can have sort with time complexity O(N)! But it's not working in-place, what a pity.
 +  * Then I've been showing Pascal language, some bits of Lazarus, and we have a homework!
 +    * **PRG1 - 2018 - L04 - Small Programs**
 +      * Solve the following [[https://drive.google.com/open?id=0B49ID9s3-zhTbFE2S005N3ZpdEk|22 problems (programs) with a Pascal program]]
 +      * If you are an expert, try to solve them with the least number of variables possible ;)
 +      * Deadline: next lab... we need to decide when that is going to be
 +  * WARNING: 30.10. - immatriculation, 6.11. - Dean's day, 13.11. - I'm in Canada ;(
 +
 +==== 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