<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: ARRAY IN C</title>
	<atom:link href="https://www.emblogic.com/blog/10/array-in-c/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.emblogic.com/blog/10/array-in-c/</link>
	<description>Embedded System and ARM Training</description>
	<lastBuildDate>Mon, 07 Oct 2013 04:00:03 +0000</lastBuildDate>
		<sy:updatePeriod>hourly</sy:updatePeriod>
		<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.9.1</generator>
	<item>
		<title>By: Amit Das</title>
		<link>https://www.emblogic.com/blog/10/array-in-c/#comment-290</link>
		<dc:creator><![CDATA[Amit Das]]></dc:creator>
		<pubDate>Mon, 03 Oct 2011 18:13:35 +0000</pubDate>
		<guid isPermaLink="false">http://emblogic.org/blog/?p=896#comment-290</guid>
		<description><![CDATA[Thanks for comments:
This is ok for replacing single element duplicates but complexity grows when we have multiple duplicates of different elements on various  positions. So I am looking for efficient searching algorithm.]]></description>
		<content:encoded><![CDATA[<p>Thanks for comments:<br />
This is ok for replacing single element duplicates but complexity grows when we have multiple duplicates of different elements on various  positions. So I am looking for efficient searching algorithm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kuldeep Dhanotia</title>
		<link>https://www.emblogic.com/blog/10/array-in-c/#comment-289</link>
		<dc:creator><![CDATA[Kuldeep Dhanotia]]></dc:creator>
		<pubDate>Mon, 03 Oct 2011 17:51:29 +0000</pubDate>
		<guid isPermaLink="false">http://emblogic.org/blog/?p=896#comment-289</guid>
		<description><![CDATA[compare each array index value one by one with whole array, if it found both are similar then delete it or shifts lower index to up side by using loop and inserting statement a[i]==a[i++]]]></description>
		<content:encoded><![CDATA[<p>compare each array index value one by one with whole array, if it found both are similar then delete it or shifts lower index to up side by using loop and inserting statement a[i]==a[i++]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
