<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Big-O-Notation on mellowd.co.uk</title>
    <link>https://mellowd.co.uk/tags/big-o-notation/</link>
    <description>Recent content in Big-O-Notation on mellowd.co.uk</description>
    <generator>Hugo</generator>
    <language>en-gb</language>
    <lastBuildDate>Mon, 05 Oct 2015 17:38:39 +0000</lastBuildDate>
    <atom:link href="https://mellowd.co.uk/tags/big-o-notation/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Visualising Big O notation</title>
      <link>https://mellowd.co.uk/post/visualising-big-o-notation/</link>
      <pubDate>Mon, 05 Oct 2015 17:38:39 +0000</pubDate>
      <guid>https://mellowd.co.uk/post/visualising-big-o-notation/</guid>
      <description>&lt;p&gt;I’m currently learning as much computer science as I can on the side. I’ve come across &lt;a href=&#34;https://en.wikipedia.org/wiki/Big_O_notation&#34;&gt;Big O notation&lt;/a&gt; a few times already, and while I understand it, I’m much more of a visual guy.&lt;/p&gt;
&lt;p&gt;It’s rather easy to use Python and matplotlib to graph out how a function’s execution time grows as the size of the input grows. The important things to note is not total execution time, but rather how the runtime of that function grows in relation to the input size. This can be plotted onto a graph which should give us a nice representation of Big O notations.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
