koku's life journal

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