<?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, 11 Nov 2025 12:54:56 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/6779.html</guid>
  <pubDate>Tue, 11 Nov 2025 12:54:56 GMT</pubDate>
  <title>Tuesday 2025-11-11</title>
  <link>https://kokulife.dreamwidth.org/6779.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [lecture] - the (binary) heap! how to implement it using a list, indexing it from 1 is better because then the index of the parent node is n/2 rounded down and the index of its children is 2n and 2n+1, heap sort as example of a sort that has O(nlog(n)) &lt;i&gt;and&lt;/i&gt; is in-place, dictionary and how to deal with a collision caused by the hashing function not being injective&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG030 (Programming 1) [lecture] - defined a class that uses a linked list to create a double sided queue and shows how to use assert, then some oop theory, which i know.. python has duck typing, meaning that &quot;if it walks like a duck and it quacks like a duck, then it must be a duck&quot;, the teacher gave an example from his life where he got on a filming van during the filming of the movie amadeus and he did what he was told to, so he has a small role in the movie, despite not being cast in it&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;stirling approximation&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=6779&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/6779.html</comments>
  <category>heapsort</category>
  <category>nprg062</category>
  <category>heap</category>
  <category>linked list</category>
  <category>dictionary</category>
  <category>oop</category>
  <category>nprg030</category>
  <category>sorting</category>
  <category>binary heap</category>
  <category>duck typing</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
