tag:dreamwidth.org,2025-10-04:4245574 studying notes and such Koku! 2025-11-04T13:30:58Z tag:dreamwidth.org,2025-10-04:4245574:5575 2025-11-04T13:30:58Z 2025-11-04T13:30:58Z public 0 <p>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)</p><br /><p>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</p><br /><hr><br />koku daily message:<br />amplification<br /><br /><img src="https://www.dreamwidth.org/tools/commentcount?user=kokulife&ditemid=5575" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> comments