<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Bigo on Decentralized meta-learning</title>
    <link>https://blog.costan.ro/tags/bigo/</link>
    <description>Recent content in Bigo on Decentralized meta-learning</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Thu, 04 Jun 2020 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://blog.costan.ro/tags/bigo/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>BigO complexity with graphs</title>
      <link>https://blog.costan.ro/post/2020-06-04-bigo-complexity-with-graphs/</link>
      <pubDate>Thu, 04 Jun 2020 00:00:00 +0000</pubDate>
      <guid>https://blog.costan.ro/post/2020-06-04-bigo-complexity-with-graphs/</guid>
      <description>&lt;div id=&#34;outline-container-headline-1&#34; class=&#34;outline-2&#34;&gt;&#xA;&lt;h2 id=&#34;headline-1&#34;&gt;&#xA;Overview&#xA;&lt;/h2&gt;&#xA;&lt;div id=&#34;outline-text-headline-1&#34; class=&#34;outline-text-2&#34;&gt;&#xA;&lt;p&gt;&#xA;  &lt;strong&gt;Big-O notation&lt;/strong&gt; or Big Omicron (e.g. Ο(n)) also called &amp;#34;asymptotic growth&amp;#34; notation is used to represent the worst-case scenario (the upper bound) for a given algorithm.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
