<?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>C on mellowd.co.uk</title>
    <link>https://mellowd.co.uk/tags/c/</link>
    <description>Recent content in C on mellowd.co.uk</description>
    <generator>Hugo</generator>
    <language>en-gb</language>
    <lastBuildDate>Thu, 14 May 2015 17:28:16 +0000</lastBuildDate>
    <atom:link href="https://mellowd.co.uk/tags/c/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Linked lists</title>
      <link>https://mellowd.co.uk/post/linked-lists/</link>
      <pubDate>Thu, 14 May 2015 17:28:16 +0000</pubDate>
      <guid>https://mellowd.co.uk/post/linked-lists/</guid>
      <description>&lt;p&gt;Python has a rather handy list method. It allows you to add and remove items at will. &lt;a href=&#34;http://www.laurentluce.com/posts/python-list-implementation/&#34;&gt;How it actually does this is rather elaborate and you can read all about it over here.&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;C doesn’t give you the same flexibility. When you create an array, it is of X size. That size cannot change as there is no guarantee that memory on either side of the existing array space is even free for you. For this reason there is a handy data structure called the linked list.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Structs in C</title>
      <link>https://mellowd.co.uk/post/structs-in-c/</link>
      <pubDate>Tue, 05 May 2015 20:53:04 +0000</pubDate>
      <guid>https://mellowd.co.uk/post/structs-in-c/</guid>
      <description>&lt;p&gt;Back in March 2014 &lt;a href=&#34;https://github.com/mellowdrifter/Cisco-OSPF-Checker&#34;&gt;I wrote an app in Python that would log in and check various OSPF properties.&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;When putting the data into a structure, I was limited both by knowledge and Python at the time. I ended up using a &lt;a href=&#34;https://docs.python.org/2/tutorial/datastructures.html#dictionaries&#34;&gt;dictionary&lt;/a&gt; which worked rather well, but I was never 100% happy with it.&lt;/p&gt;
&lt;p&gt;Recently I’ve stumbled across structs in C, in which I can make pretty much any data structure I would like.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Visualising recursive functions</title>
      <link>https://mellowd.co.uk/post/visualising-recursive-functions/</link>
      <pubDate>Mon, 20 Apr 2015 17:50:24 +0000</pubDate>
      <guid>https://mellowd.co.uk/post/visualising-recursive-functions/</guid>
      <description>&lt;p&gt;I’ve been doing a lot of coding practise, and recursive functions are one of those things that’s easier to visualise than think about.&lt;/p&gt;
&lt;p&gt;At it’s heart, a recursive function is one that calls itself in over and over again until a result is found. At first that doesn’t make sense so let’s look at an example.&lt;/p&gt;
&lt;h2 id=&#34;factorial&#34;&gt;Factorial&lt;/h2&gt;
&lt;p&gt;The factorial of a number is the product off all numbers from that number down to 1. Two examples follow:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
