<?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: SortFix &#8211; A Creative Way To Search The Web</title>
	<atom:link href="http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/</link>
	<description></description>
	<lastBuildDate>Wed, 30 Nov 2011 19:02:40 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: hathalye</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-44</link>
		<dc:creator>hathalye</dc:creator>
		<pubDate>Tue, 30 Mar 2010 14:13:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-44</guid>
		<description>I am sorry the title mislead you into thinking something else. But the tool itself is quite fascinating. Have you given it a try?</description>
		<content:encoded><![CDATA[<p>I am sorry the title mislead you into thinking something else. But the tool itself is quite fascinating. Have you given it a try?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ramkumar</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-43</link>
		<dc:creator>Ramkumar</dc:creator>
		<pubDate>Tue, 30 Mar 2010 13:36:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-43</guid>
		<description>The service looks like a Data structure implementation of Stacks. At first reading the title i though you were mentioning something similar to quick sort and heap sort .</description>
		<content:encoded><![CDATA[<p>The service looks like a Data structure implementation of Stacks. At first reading the title i though you were mentioning something similar to quick sort and heap sort .</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: hathalye</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-38</link>
		<dc:creator>hathalye</dc:creator>
		<pubDate>Wed, 24 Mar 2010 20:52:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-38</guid>
		<description>Thanks Lakhyajyoti for visiting. Hope we will learn more from each other.</description>
		<content:encoded><![CDATA[<p>Thanks Lakhyajyoti for visiting. Hope we will learn more from each other.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lakhyajyoti</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-36</link>
		<dc:creator>Lakhyajyoti</dc:creator>
		<pubDate>Wed, 24 Mar 2010 14:10:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-36</guid>
		<description>Nice and informative post.This is really a new tool for me.Thanks for the post.</description>
		<content:encoded><![CDATA[<p>Nice and informative post.This is really a new tool for me.Thanks for the post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: hathalye</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-35</link>
		<dc:creator>hathalye</dc:creator>
		<pubDate>Mon, 22 Mar 2010 18:48:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-35</guid>
		<description>Hi Tom,

Thanks for your time visiting the blog and for your encouraging words. I really liked the tool you guys have developed and hope to see more such cool features added to it. Keep up the good work!</description>
		<content:encoded><![CDATA[<p>Hi Tom,</p>
<p>Thanks for your time visiting the blog and for your encouraging words. I really liked the tool you guys have developed and hope to see more such cool features added to it. Keep up the good work!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tom</title>
		<link>http://www.letsgeek.net/2010/03/sortfix-a-creative-way-to-search-the-web/comment-page-1/#comment-34</link>
		<dc:creator>tom</dc:creator>
		<pubDate>Mon, 22 Mar 2010 12:47:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.letsgeek.net/?p=495#comment-34</guid>
		<description>This is a well written post, which describes our search concept in detail.
great job!

I have a little supplementary:
SortFix &quot;Power Words&quot; technology is very complex and has search engine/sorting  unique ingredients, so its not just an interface. We actually analyze the results in real time, and very fast, up to 40 ms to retrive the most powerful words.

Thank you
Tom</description>
		<content:encoded><![CDATA[<p>This is a well written post, which describes our search concept in detail.<br />
great job!</p>
<p>I have a little supplementary:<br />
SortFix &#8220;Power Words&#8221; technology is very complex and has search engine/sorting  unique ingredients, so its not just an interface. We actually analyze the results in real time, and very fast, up to 40 ms to retrive the most powerful words.</p>
<p>Thank you<br />
Tom</p>
]]></content:encoded>
	</item>
</channel>
</rss>

