<?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>Linked-List on mellowd.co.uk</title>
    <link>https://mellowd.co.uk/tags/linked-list/</link>
    <description>Recent content in Linked-List 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/linked-list/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>
  </channel>
</rss>
