<?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: Computer Algorithms: Rabin-Karp String Searching</title>
	<atom:link href="/2012/04/02/computer-algorithms-rabin-karp-string-searching/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Lynelle Peeden</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-481656</link>
		<dc:creator><![CDATA[Lynelle Peeden]]></dc:creator>
		<pubDate>Mon, 19 Feb 2018 15:26:44 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-481656</guid>
		<description><![CDATA[Sure thing &#038; done.I’ve only hacked it so everything is converted to lowercase but the end result is that both UPPER &#038; lower cases are accepted.]]></description>
		<content:encoded><![CDATA[<p>Sure thing &amp; done.I’ve only hacked it so everything is converted to lowercase but the end result is that both UPPER &amp; lower cases are accepted.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mahnoor</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-451270</link>
		<dc:creator><![CDATA[Mahnoor]]></dc:creator>
		<pubDate>Sun, 30 Apr 2017 14:50:15 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-451270</guid>
		<description><![CDATA[It&#039;s really nice. It help me in my presentation. I understand it very well.
Thanks]]></description>
		<content:encoded><![CDATA[<p>It&#8217;s really nice. It help me in my presentation. I understand it very well.<br />
Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bryan</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-19575</link>
		<dc:creator><![CDATA[Bryan]]></dc:creator>
		<pubDate>Wed, 23 Oct 2013 06:40:32 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-19575</guid>
		<description><![CDATA[thanks a lot, very good explanation especially to those who are trying to understand it for the first time. dont mind the haterzzzz]]></description>
		<content:encoded><![CDATA[<p>thanks a lot, very good explanation especially to those who are trying to understand it for the first time. dont mind the haterzzzz</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tomas</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-19482</link>
		<dc:creator><![CDATA[Tomas]]></dc:creator>
		<pubDate>Sat, 12 Oct 2013 12:30:20 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-19482</guid>
		<description><![CDATA[A terrible, terrible hash function...]]></description>
		<content:encoded><![CDATA[<p>A terrible, terrible hash function&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Syed Arshad</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-18653</link>
		<dc:creator><![CDATA[Syed Arshad]]></dc:creator>
		<pubDate>Thu, 02 May 2013 09:42:05 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-18653</guid>
		<description><![CDATA[Very nice post sir. I am referring T.H.Cormen&#039;s &quot;Introduction to  Algorithms&quot;. This post helped me to implement RK algorithm in my program :)

Thank you :)]]></description>
		<content:encoded><![CDATA[<p>Very nice post sir. I am referring T.H.Cormen&#8217;s &#8220;Introduction to  Algorithms&#8221;. This post helped me to implement RK algorithm in my program 🙂</p>
<p>Thank you 🙂</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ATec</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-17815</link>
		<dc:creator><![CDATA[ATec]]></dc:creator>
		<pubDate>Fri, 14 Dec 2012 10:06:59 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-17815</guid>
		<description><![CDATA[Ignatz Ratzkewatzke says:
…
(2) The algorithm returns any string with the same hash as the pattern.
…
answer:

test with hash pattern not only used for return match ok.,it is useful for not equal patterns and so
eliminate possible other variations. after hashed check must be checked also normal pattern.]]></description>
		<content:encoded><![CDATA[<p>Ignatz Ratzkewatzke says:<br />
…<br />
(2) The algorithm returns any string with the same hash as the pattern.<br />
…<br />
answer:</p>
<p>test with hash pattern not only used for return match ok.,it is useful for not equal patterns and so<br />
eliminate possible other variations. after hashed check must be checked also normal pattern.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dishan</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-17525</link>
		<dc:creator><![CDATA[Dishan]]></dc:creator>
		<pubDate>Mon, 03 Dec 2012 02:51:58 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-17525</guid>
		<description><![CDATA[Easy to understand and very clear.. keep it up...... :) 
thank you &#038; Lord buddhas bless you...!!!!]]></description>
		<content:encoded><![CDATA[<p>Easy to understand and very clear.. keep it up&#8230;&#8230; 🙂<br />
thank you &amp; Lord buddhas bless you&#8230;!!!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: May Thu Zar Soe</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-16085</link>
		<dc:creator><![CDATA[May Thu Zar Soe]]></dc:creator>
		<pubDate>Sun, 24 Jun 2012 02:04:50 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-16085</guid>
		<description><![CDATA[This algorithm is very useful for my thesis.]]></description>
		<content:encoded><![CDATA[<p>This algorithm is very useful for my thesis.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Theo Vosse</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-15432</link>
		<dc:creator><![CDATA[Theo Vosse]]></dc:creator>
		<pubDate>Mon, 09 Apr 2012 07:15:37 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-15432</guid>
		<description><![CDATA[Your implementation is wrong. You need a &quot;rolling&quot; hash. The complexity in your version is O(n*m), since you&#039;re repeating the inner loop of the hash function n * m times. You can improve your code by first taking out the oldest character from the hash, then shifting all remaining characters one position, then adding the new one. That takes constant time, so complexity will become O(n+m).]]></description>
		<content:encoded><![CDATA[<p>Your implementation is wrong. You need a &#8220;rolling&#8221; hash. The complexity in your version is O(n*m), since you&#8217;re repeating the inner loop of the hash function n * m times. You can improve your code by first taking out the oldest character from the hash, then shifting all remaining characters one position, then adding the new one. That takes constant time, so complexity will become O(n+m).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brian Cardarella</title>
		<link>/2012/04/02/computer-algorithms-rabin-karp-string-searching/comment-page-1/#comment-15422</link>
		<dc:creator><![CDATA[Brian Cardarella]]></dc:creator>
		<pubDate>Sat, 07 Apr 2012 08:50:42 +0000</pubDate>
		<guid isPermaLink="false">/?p=2991#comment-15422</guid>
		<description><![CDATA[Very nice post!]]></description>
		<content:encoded><![CDATA[<p>Very nice post!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
