<?xml version='1.0' encoding='utf-8' ?>

<rss version='2.0' xmlns:lj='http://www.livejournal.org/rss/lj/1.0/' xmlns:atom10='http://www.w3.org/2005/Atom'>
<channel>
  <title>koku&apos;s life journal</title>
  <link>https://kokulife.dreamwidth.org/</link>
  <description>koku&apos;s life journal - Dreamwidth Studios</description>
  <lastBuildDate>Tue, 04 Nov 2025 13:30:58 GMT</lastBuildDate>
  <generator>LiveJournal / Dreamwidth Studios</generator>
  <lj:journal>kokulife</lj:journal>
  <lj:journaltype>personal</lj:journaltype>
  <image>
    <url>https://v2.dreamwidth.org/18093858/4245574</url>
    <title>koku&apos;s life journal</title>
    <link>https://kokulife.dreamwidth.org/</link>
    <width>100</width>
    <height>100</height>
  </image>

<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/5575.html</guid>
  <pubDate>Tue, 04 Nov 2025 13:30:58 GMT</pubDate>
  <title>Tuesday 2025-11-04</title>
  <link>https://kokulife.dreamwidth.org/5575.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [lecture] - proof that the best big O of a sorting function is nlog(n) using a binary tree and stirling&apos;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)&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG030 (Programming 1) [lecture] - tuples, dictionaries and objects, apparently big o of a dictionary is O(1) except for when it sometimes isn&apos;t.. and an implementation of linked lists&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;amplification&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=5575&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/5575.html</comments>
  <category>big o</category>
  <category>countsort</category>
  <category>data structures</category>
  <category>radixsort</category>
  <category>queue</category>
  <category>nprg062</category>
  <category>nprg030</category>
  <category>dictionary</category>
  <category>linked list</category>
  <category>object</category>
  <category>stack</category>
  <category>sorting</category>
  <category>python</category>
  <category>bucketsort</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
