<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.0.7" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Clash of the Titans: Linked List vs. Array</title>
	<link>http://www.technicalinterviews.net/clash-of-the-titans-linked-list-vs-array/</link>
	<description>This site features a collection of common technical interview questions gathered by a group of programmers who have been through, and given, lots of technical interviews. There is an emphasis on C++ and game programming technical interviews, but most of the questions are relevant to any technical interview.</description>
	<pubDate>Mon, 05 Jan 2009 23:58:39 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.0.7</generator>

	<item>
		<title>by: shrishail s. Hundekari</title>
		<link>http://www.technicalinterviews.net/clash-of-the-titans-linked-list-vs-array/#comment-141</link>
		<pubDate>Thu, 01 Mar 2007 15:31:09 +0000</pubDate>
		<guid>http://www.technicalinterviews.net/clash-of-the-titans-linked-list-vs-array/#comment-141</guid>
					<description>***LL overr Array***
--&#62; ADVANTAGE
a]As Linked list(dynamic) allocates memory as per requirement, hence it saves memory in both cases 1: if LL is empty no mem. is allocated.
2: if LL has some data, mem. is restricted to data itself. 
b]LL can be easily manipulated and can be easily diverted to various other data Structures like trees,stacks,queues,etc.

--&#62;DISADVANTAGE

a]As LL uses addresses for linking adjasant nodes, needs extra mem. than actual data to store addresses.
b]As uses addresses,needs pointers,difficult to handle pointers.</description>
		<content:encoded><![CDATA[<p>***LL overr Array***<br />
&#8211;&gt; ADVANTAGE<br />
a]As Linked list(dynamic) allocates memory as per requirement, hence it saves memory in both cases 1: if LL is empty no mem. is allocated.<br />
2: if LL has some data, mem. is restricted to data itself.<br />
b]LL can be easily manipulated and can be easily diverted to various other data Structures like trees,stacks,queues,etc.</p>
<p>&#8211;&gt;DISADVANTAGE</p>
<p>a]As LL uses addresses for linking adjasant nodes, needs extra mem. than actual data to store addresses.<br />
b]As uses addresses,needs pointers,difficult to handle pointers.
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
