<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Nam H. Pham &#187; algorithm</title>
	<atom:link href="http://www.namhpham.com/tag/algorithm/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.namhpham.com</link>
	<description>Welcome to my world</description>
	<lastBuildDate>Fri, 09 Jul 2010 17:56:31 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Shuffle an array</title>
		<link>http://www.namhpham.com/2010/01/shuffle-an-array/</link>
		<comments>http://www.namhpham.com/2010/01/shuffle-an-array/#comments</comments>
		<pubDate>Sun, 10 Jan 2010 14:30:41 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Job]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[shuffle]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/2010/01/shuffle-an-array/</guid>
		<description><![CDATA[Given an array a1, a2, a3, &#8230; an, b1, b2, b3&#8230; bn, convert it to an array a1,b2,a 2,b2,a3,b3&#8230;.an,bn in O(1) space and O(n) time. The current algorithm I came up with is O(1) space but O(n^2) running time. I think it should have some property to make a transformation chain from the original array [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/01/shuffle-an-array/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
