<?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>IMPOSSIBLEr</title>
	<atom:link href="http://blog.ifanchu.com/feed" rel="self" type="application/rss+xml" />
	<link>http://blog.ifanchu.com</link>
	<description>blog.ifanchu.com</description>
	<lastBuildDate>Mon, 28 Jun 2010 17:04:16 +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>[My favorite series] Circus Ponies Notebook</title>
		<link>http://blog.ifanchu.com/archives/421</link>
		<comments>http://blog.ifanchu.com/archives/421#comments</comments>
		<pubDate>Mon, 28 Jun 2010 17:04:14 +0000</pubDate>
		<dc:creator>I-Fan</dc:creator>
				<category><![CDATA[Mac]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://blog.ifanchu.com/?p=421</guid>
		<description><![CDATA[I have been using Mac for one year, I am very satisfied with the performance and appearance Mac gave me. Because I believe in 『efficiency stands on good tools』, I am always looking for wonderful tools for some specific purposes. So, today is the premiere of My favorite series posts by starting from introducing the [...]]]></description>
		<wfw:commentRss>http://blog.ifanchu.com/archives/421/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How to find all the subsets of a given List(or Collection): Part 1</title>
		<link>http://blog.ifanchu.com/archives/413</link>
		<comments>http://blog.ifanchu.com/archives/413#comments</comments>
		<pubDate>Thu, 24 Jun 2010 04:59:05 +0000</pubDate>
		<dc:creator>I-Fan</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Algorithm]]></category>

		<guid isPermaLink="false">http://blog.ifanchu.com/?p=413</guid>
		<description><![CDATA[Today I am going to share the algorithm of how to generate all the subsets from a given Collection. For example, if the given collection is an int array [1,2,3], then its subsets are [[1], [2],[3],[1,2],[1,3],[2,3],[1,2,3]]. First of all, let&#8217;s look at the first few examples.


Source
Subsets


[1]
[1]


[1,2]
[1],[2],[1,2]


[1,2,3]
[1], [2],[3],[1,2],[1,3],[2,3],[1,2,3]



Basically, if there are n elements in the given [...]]]></description>
		<wfw:commentRss>http://blog.ifanchu.com/archives/413/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Search an ascending String array interspersed with empty Strings</title>
		<link>http://blog.ifanchu.com/archives/405</link>
		<comments>http://blog.ifanchu.com/archives/405#comments</comments>
		<pubDate>Fri, 21 May 2010 21:38:39 +0000</pubDate>
		<dc:creator>I-Fan</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Algorithm]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://blog.ifanchu.com/?p=405</guid>
		<description><![CDATA[The problem is stated as: 

Given a String array arr, where all the strings in it is pre-sorted in ascending order, however, there are indefinite number of empty strings in it as well. For example, 
arr={"", "", "", "36b", "ich099tb", "yi", "zrdy46", "", "", "", ""}
We can tackle this problem by using a modified binary [...]]]></description>
		<wfw:commentRss>http://blog.ifanchu.com/archives/405/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>LOCSale.com: Website for Moving Sale</title>
		<link>http://blog.ifanchu.com/archives/390</link>
		<comments>http://blog.ifanchu.com/archives/390#comments</comments>
		<pubDate>Sat, 15 May 2010 05:03:34 +0000</pubDate>
		<dc:creator>I-Fan</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[locsale.com]]></category>

		<guid isPermaLink="false">http://blog.ifanchu.com/?p=390</guid>
		<description><![CDATA[
LOCSale.com
 was developed in an effort of assisting people who are having a moving sale and those who are going to move to a new place and need some stuff from moving sale. I have been working on this website and that&#8217;s why my blog is not updating for a while. This post is to [...]]]></description>
		<wfw:commentRss>http://blog.ifanchu.com/archives/390/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Find common numbers in arrays: Part 3</title>
		<link>http://blog.ifanchu.com/archives/381</link>
		<comments>http://blog.ifanchu.com/archives/381#comments</comments>
		<pubDate>Sun, 02 May 2010 19:45:16 +0000</pubDate>
		<dc:creator>I-Fan</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Algorithm]]></category>
		<category><![CDATA[Array]]></category>

		<guid isPermaLink="false">http://blog.ifanchu.com/?p=381</guid>
		<description><![CDATA[Reminder: out problems are

How to find the first common integer in two pre-sorted array
How to find the first common integer in two unsorted array
How to find all the common numbers in two pre-sorted array
How to find all the common numbers in two unsorted array
How to find all the common numbers in three pre-sorted array
How to [...]]]></description>
		<wfw:commentRss>http://blog.ifanchu.com/archives/381/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
