<?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: About</title>
	<atom:link href="/about/feed/" rel="self" type="application/rss+xml" />
	<link></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: mrt</title>
		<link>/about/comment-page-1/#comment-420317</link>
		<dc:creator><![CDATA[mrt]]></dc:creator>
		<pubDate>Fri, 16 Sep 2016 00:04:14 +0000</pubDate>
		<guid isPermaLink="false">#comment-420317</guid>
		<description><![CDATA[I think you should create an article index according to categories. You have very qualified articles but i cant see them tidy.]]></description>
		<content:encoded><![CDATA[<p>I think you should create an article index according to categories. You have very qualified articles but i cant see them tidy.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: MOHAN</title>
		<link>/about/comment-page-1/#comment-418792</link>
		<dc:creator><![CDATA[MOHAN]]></dc:creator>
		<pubDate>Thu, 01 Sep 2016 05:33:50 +0000</pubDate>
		<guid isPermaLink="false">#comment-418792</guid>
		<description><![CDATA[Hello Sir,

Can you please couple of linked list examples as well using javascript]]></description>
		<content:encoded><![CDATA[<p>Hello Sir,</p>
<p>Can you please couple of linked list examples as well using javascript</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sam</title>
		<link>/about/comment-page-1/#comment-413814</link>
		<dc:creator><![CDATA[Sam]]></dc:creator>
		<pubDate>Mon, 18 Jul 2016 10:04:50 +0000</pubDate>
		<guid isPermaLink="false">#comment-413814</guid>
		<description><![CDATA[This is the first time when I come to know a blog which is explaining algorithm very clearly. Love to read it. I was searching for Email Subscription box but  I could not. I am your fan.]]></description>
		<content:encoded><![CDATA[<p>This is the first time when I come to know a blog which is explaining algorithm very clearly. Love to read it. I was searching for Email Subscription box but  I could not. I am your fan.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sanford Hersh</title>
		<link>/about/comment-page-1/#comment-398544</link>
		<dc:creator><![CDATA[Sanford Hersh]]></dc:creator>
		<pubDate>Sun, 28 Feb 2016 03:21:28 +0000</pubDate>
		<guid isPermaLink="false">#comment-398544</guid>
		<description><![CDATA[A unique algorithm that uses a truth table may be of interest. It does it in only three lines of code. The first line initializes the table.  The second line updates the table and when completed all occurrences are found. The third line converts the truth table to positions.

   for( x = 0; x &#060; endsiz; x++ ) 
       *ary++ = string[ x ] == substg[ 0 ]; 

   for( y = 1, ary = startmem; y &#060; sizsub; y++, ary = startmem ) 
       for( x = y; x &#060; ( endsiz + y ); x++ ) 
           *ary++ &#038;= string[ x ] == substg[ y ]; 

   for( y = 0, x = 0; ( x &#060; endsiz ) &#038;&#038; ( y &#060; sizvec ); x++ ) 
       if ( *ary++ ) 
           vec[ y++ ] = x; 

Because of the limitations of C, the positions are limited to an arbitrary length. A more detailed explanation can be found in: http://1drv.ms/1PuVpzS]]></description>
		<content:encoded><![CDATA[<p>A unique algorithm that uses a truth table may be of interest. It does it in only three lines of code. The first line initializes the table.  The second line updates the table and when completed all occurrences are found. The third line converts the truth table to positions.</p>
<p>   for( x = 0; x &lt; endsiz; x++ )<br />
       *ary++ = string[ x ] == substg[ 0 ]; </p>
<p>   for( y = 1, ary = startmem; y &lt; sizsub; y++, ary = startmem )<br />
       for( x = y; x &lt; ( endsiz + y ); x++ )<br />
           *ary++ &amp;= string[ x ] == substg[ y ]; </p>
<p>   for( y = 0, x = 0; ( x &lt; endsiz ) &amp;&amp; ( y &lt; sizvec ); x++ )<br />
       if ( *ary++ )<br />
           vec[ y++ ] = x; </p>
<p>Because of the limitations of C, the positions are limited to an arbitrary length. A more detailed explanation can be found in: <a href="http://1drv.ms/1PuVpzS" rel="nofollow">http://1drv.ms/1PuVpzS</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ced</title>
		<link>/about/comment-page-1/#comment-388510</link>
		<dc:creator><![CDATA[ced]]></dc:creator>
		<pubDate>Thu, 10 Dec 2015 09:34:51 +0000</pubDate>
		<guid isPermaLink="false">#comment-388510</guid>
		<description><![CDATA[Hi Stoimen,

Many thanks for your great site. It&#039;s been a while since I&#039;ve learned those algorithms and data structures in school but after reading your site, I couldn&#039;t resist to sit down and start coding my way through them again! Great inspiration!

Thank you!
/ced]]></description>
		<content:encoded><![CDATA[<p>Hi Stoimen,</p>
<p>Many thanks for your great site. It&#8217;s been a while since I&#8217;ve learned those algorithms and data structures in school but after reading your site, I couldn&#8217;t resist to sit down and start coding my way through them again! Great inspiration!</p>
<p>Thank you!<br />
/ced</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luis</title>
		<link>/about/comment-page-1/#comment-387479</link>
		<dc:creator><![CDATA[Luis]]></dc:creator>
		<pubDate>Thu, 03 Dec 2015 10:31:41 +0000</pubDate>
		<guid isPermaLink="false">#comment-387479</guid>
		<description><![CDATA[Thanks for sharing your knowledge. 

I have a question you could maybe help me to answer. I would like to know if there are well-known methods (algorithms) to construct a directed acyclic graph for instance such that each vertex has a fixed indegree value. Since I&#039;m not from the field of computer science or math I do not know them. Any help will be appreciated.   

Thanks!]]></description>
		<content:encoded><![CDATA[<p>Thanks for sharing your knowledge. </p>
<p>I have a question you could maybe help me to answer. I would like to know if there are well-known methods (algorithms) to construct a directed acyclic graph for instance such that each vertex has a fixed indegree value. Since I&#8217;m not from the field of computer science or math I do not know them. Any help will be appreciated.   </p>
<p>Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Martin</title>
		<link>/about/comment-page-1/#comment-308437</link>
		<dc:creator><![CDATA[Martin]]></dc:creator>
		<pubDate>Sun, 03 May 2015 21:35:12 +0000</pubDate>
		<guid isPermaLink="false">#comment-308437</guid>
		<description><![CDATA[Hi Stoimen,
thank you for sharing your algorithms with us. I like the visualisation of the sort -algorithms, helped me to understand  the process. Your site should be on  on Google first entry, would save alot of research time.

thanks,
Martin]]></description>
		<content:encoded><![CDATA[<p>Hi Stoimen,<br />
thank you for sharing your algorithms with us. I like the visualisation of the sort -algorithms, helped me to understand  the process. Your site should be on  on Google first entry, would save alot of research time.</p>
<p>thanks,<br />
Martin</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gaurav Ramesh</title>
		<link>/about/comment-page-1/#comment-269591</link>
		<dc:creator><![CDATA[Gaurav Ramesh]]></dc:creator>
		<pubDate>Thu, 19 Feb 2015 03:12:00 +0000</pubDate>
		<guid isPermaLink="false">#comment-269591</guid>
		<description><![CDATA[Hi Stoimen,

I came across this site searching for bucket sort. And the first thought that came to my mind from your site name was &#039;stoi(C++)-men&#039; .. so I thought it was kinda apt name for a data structures and algorithms blog! Didn&#039;t realize it was your name ! :D]]></description>
		<content:encoded><![CDATA[<p>Hi Stoimen,</p>
<p>I came across this site searching for bucket sort. And the first thought that came to my mind from your site name was &#8216;stoi(C++)-men&#8217; .. so I thought it was kinda apt name for a data structures and algorithms blog! Didn&#8217;t realize it was your name ! 😀</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Engin</title>
		<link>/about/comment-page-1/#comment-208654</link>
		<dc:creator><![CDATA[Engin]]></dc:creator>
		<pubDate>Fri, 05 Dec 2014 08:31:19 +0000</pubDate>
		<guid isPermaLink="false">#comment-208654</guid>
		<description><![CDATA[Your site is terrific. Contents is great and it seems you have an eye for design as well.
The quality of visuals and harmony of colors really drew me in.

Do you write on Quora?]]></description>
		<content:encoded><![CDATA[<p>Your site is terrific. Contents is great and it seems you have an eye for design as well.<br />
The quality of visuals and harmony of colors really drew me in.</p>
<p>Do you write on Quora?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rowan Ferrabee</title>
		<link>/about/comment-page-1/#comment-147403</link>
		<dc:creator><![CDATA[Rowan Ferrabee]]></dc:creator>
		<pubDate>Fri, 31 Oct 2014 00:06:33 +0000</pubDate>
		<guid isPermaLink="false">#comment-147403</guid>
		<description><![CDATA[I just stumbled upon your website and I think it&#039;s absolute awesome! Thank you for putting this together so well; your posts are perfectly informative, fun, interesting, and easy to read and I&#039;ve honestly learned more in 20 minutes here that I could in 2 hours at any other coding site. I look forward to checking it out in more depth soon.

Rowan]]></description>
		<content:encoded><![CDATA[<p>I just stumbled upon your website and I think it&#8217;s absolute awesome! Thank you for putting this together so well; your posts are perfectly informative, fun, interesting, and easy to read and I&#8217;ve honestly learned more in 20 minutes here that I could in 2 hours at any other coding site. I look forward to checking it out in more depth soon.</p>
<p>Rowan</p>
]]></content:encoded>
	</item>
</channel>
</rss>
