NPRG062 (Introduction to algorithms) [lecture] - proof that the best big O of a sorting function is nlog(n) using a binary tree and stirling's formula for approximating factorials, after we did count and bucket sort, both having O(n+R) where R is the difference between min and max of input data and radix sort having O(n*logR), after we did data structures, something about lists.. and abstract data structures: stack (fifo) and queue (lifo)

NPRG030 (Programming 1) [lecture] - tuples, dictionaries and objects, apparently big o of a dictionary is O(1) except for when it sometimes isn't.. and an implementation of linked lists

---

koku daily message:
amplification

NPRG062 (Introduction to algorithms) [tutorial] - we had some problems and had to design algorithms with the lowest O it's a short class so there wasn't that much

NPRG030 (Programming 1) [tutorial] - we went over some of the things that were taught during the lecture, homework is create a city using some python library for 3D simple shapes, seems like it's gonna take a bit of time to get used to how it works

NJAZ070 (English for Upper-Intermediate Students I) - very easy so far, just some intricacies of the future tenses, where to use will, going to or -ing, i didn't actually know that officially you are to use the -ing form only for arrangements, i.e. agreement between two or more parties, using -ing for any other form future is informal (for example: i am having salmon for dinner tonight)

when waiting for my train home i met a former classmate from high school there (who i'll tag as z cause that's his first initial), he studies in brno and only has seminars until wednesday, hence why i met him on thursday, he was surprised to learn that i take the bus/train to and from prague everyday, as we both live in pilsen (on the same street actually but that's beside the point)

---

koku daily message:
science is not finished until it's communicated