<?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; Algorithms</title>
	<atom:link href="http://www.namhpham.com/category/research/algorithms/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</generator>
		<item>
		<title>Majority Element</title>
		<link>http://www.namhpham.com/2010/06/majority-element/</link>
		<comments>http://www.namhpham.com/2010/06/majority-element/#comments</comments>
		<pubDate>Wed, 02 Jun 2010 15:41:50 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=495</guid>
		<description><![CDATA[This is a very interesting question I found in CareerCup.com (link): Given an unsorted array of n numbers, find the number that appears more than n/2 times. Do it in O(n) time and O(1) space. First, I did not come up with the solution. The solution is described here. Second, the idea is as follow: [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/06/majority-element/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Calculate week-day names for future date</title>
		<link>http://www.namhpham.com/2010/03/calculate-week-day-names-for-future-date/</link>
		<comments>http://www.namhpham.com/2010/03/calculate-week-day-names-for-future-date/#comments</comments>
		<pubDate>Thu, 25 Mar 2010 04:39:20 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[C/C++]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=392</guid>
		<description><![CDATA[This is very very old problem I encountered when I was in high school. It is good to bring it back Given current date with the week-day name i.e. 03/24/2010 Wednesday. Calculate the week-day names for future date ? For example: what is the week-day name for 01/01/3999 ? (The answer is Friday) The idea [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/03/calculate-week-day-names-for-future-date/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>String Permutaton Problems</title>
		<link>http://www.namhpham.com/2010/03/string-permutaton-problems/</link>
		<comments>http://www.namhpham.com/2010/03/string-permutaton-problems/#comments</comments>
		<pubDate>Tue, 02 Mar 2010 23:43:53 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[generation]]></category>
		<category><![CDATA[permutation]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[string]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=333</guid>
		<description><![CDATA[Hi, Today I am trying to solve two interesting problems in String Permutations: 1. Generate all permutation of a string with assumption that all characters are unique. 2. Generate all permutation of a string without a &#8220;uniqueness&#8221; assumption like above. Here is the detail: 1. Generate all permutation of a string with assumption that all [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/03/string-permutaton-problems/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Hashing in Java</title>
		<link>http://www.namhpham.com/2010/02/hashing-in-java/</link>
		<comments>http://www.namhpham.com/2010/02/hashing-in-java/#comments</comments>
		<pubDate>Sun, 28 Feb 2010 16:28:40 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=328</guid>
		<description><![CDATA[This is my summary after reading a wonderful article from ibm (Java theory and practice: Hashing it out. In my understanding, every object in Java has two implemented methods hashCode() and equals() to identify each object to others. A general rule is that two objects are equal to each other, they have the same hashcode [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/02/hashing-in-java/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Binary Search</title>
		<link>http://www.namhpham.com/2010/01/binary-search/</link>
		<comments>http://www.namhpham.com/2010/01/binary-search/#comments</comments>
		<pubDate>Wed, 20 Jan 2010 02:48:27 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Job]]></category>
		<category><![CDATA[linkedin]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=300</guid>
		<description><![CDATA[As a programmer, most of us have at least coded the binary search algorithm: the algorithm to find a value in a sorted array. The algorithm itself is clear and easy to understand: ?View Code CPP1 2 3 4 5 6 7 8 9 10 11 int BinSearch::bSearch&#40;int* arr,int n, int value&#41;&#123; int left = [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/01/binary-search/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
