<?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</title>
	<atom:link href="http://www.namhpham.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.namhpham.com</link>
	<description>Welcome to my world</description>
	<lastBuildDate>Fri, 05 Mar 2010 16:33:25 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<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.
The idea is recursively choose &#8216;available&#8221; character to build a new string.

?View Code JAVA1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
        private boolean&#91;&#93; mask = null;
	private char&#91;&#93; charSeq = null;
&#160;
	//print all [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/03/string-permutaton-problems/feed/</wfw:commentRss>
		<slash:comments>2</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 (but [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/02/hashing-in-java/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Add &#8220;Create a new txt document&#8221; in New menu (Windows 7)</title>
		<link>http://www.namhpham.com/2010/02/add-create-a-new-txt-document-in-new-menu-windows-7/</link>
		<comments>http://www.namhpham.com/2010/02/add-create-a-new-txt-document-in-new-menu-windows-7/#comments</comments>
		<pubDate>Sun, 14 Feb 2010 00:11:50 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=320</guid>
		<description><![CDATA[I have been using Windows 7 for a while and have nice experience with it except two problems with Windows Explorer:
1. It does not automatically update the content folder when I created/deleted files.
2. It does not have &#8220;Create a new text document&#8221; in New menu when you right click in the folder space.

I followed the [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/02/add-create-a-new-txt-document-in-new-menu-windows-7/feed/</wfw:commentRss>
		<slash:comments>0</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 = 0;
	int right = n;
	while &#40;left &#60;= right&#41;&#123;
		int mid = &#40;int&#41;&#40;left+right&#41;/2;
		if &#40;arr&#91;mid&#93; == value&#41; [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/01/binary-search/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Winter 09-10</title>
		<link>http://www.namhpham.com/2010/01/winter-09-10/</link>
		<comments>http://www.namhpham.com/2010/01/winter-09-10/#comments</comments>
		<pubDate>Sun, 17 Jan 2010 20:47:50 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=288</guid>
		<description><![CDATA[On the way to my lab, I encountered some beautiful views in the &#8220;early&#8221; winter morning   .
I want to share with you guys. Please enjoy   

The whole album is here
]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/01/winter-09-10/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
