<?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: Debugging with GDB	</title>
	<atom:link href="https://betterexplained.com/articles/debugging-with-gdb/feed/" rel="self" type="application/rss+xml" />
	<link>https://betterexplained.com/articles/debugging-with-gdb/</link>
	<description>Math lessons that click</description>
	<lastBuildDate>Tue, 18 Jul 2017 22:32:48 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	
	<item>
		<title>
		By: Sumit Singh		</title>
		<link>https://betterexplained.com/articles/debugging-with-gdb/#comment-328041</link>

		<dc:creator><![CDATA[Sumit Singh]]></dc:creator>
		<pubDate>Fri, 04 Apr 2014 02:17:49 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/debugging-with-gdb/#comment-328041</guid>

					<description><![CDATA[Really very useful, important contents are explained with the help of examples.
Thanks]]></description>
			<content:encoded><![CDATA[<p>Really very useful, important contents are explained with the help of examples.<br />
Thanks</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Ramaswamy		</title>
		<link>https://betterexplained.com/articles/debugging-with-gdb/#comment-327359</link>

		<dc:creator><![CDATA[Ramaswamy]]></dc:creator>
		<pubDate>Thu, 21 Nov 2013 04:45:11 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/debugging-with-gdb/#comment-327359</guid>

					<description><![CDATA[Very good explanation in simpler way. It&#039;s very much usefull.

Thanks so much.]]></description>
			<content:encoded><![CDATA[<p>Very good explanation in simpler way. It&#8217;s very much usefull.</p>
<p>Thanks so much.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Ian S		</title>
		<link>https://betterexplained.com/articles/debugging-with-gdb/#comment-192697</link>

		<dc:creator><![CDATA[Ian S]]></dc:creator>
		<pubDate>Thu, 21 Feb 2013 20:40:32 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/debugging-with-gdb/#comment-192697</guid>

					<description><![CDATA[Thanks for the quick tutorial, the basics look very simple and easy to use.]]></description>
			<content:encoded><![CDATA[<p>Thanks for the quick tutorial, the basics look very simple and easy to use.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: noname		</title>
		<link>https://betterexplained.com/articles/debugging-with-gdb/#comment-62183</link>

		<dc:creator><![CDATA[noname]]></dc:creator>
		<pubDate>Fri, 16 Mar 2012 19:53:19 +0000</pubDate>
		<guid isPermaLink="false">http://betterexplained.com/articles/debugging-with-gdb/#comment-62183</guid>

					<description><![CDATA[#include

using namespace std ;

int main()
{
	string stra , strb , strc ;
	cin&#062;&#062;stra&#062;&#062;strb&#062;&#062;strc ;
	
	int lena , lenb , lenc ;
	lena = stra.length(); lenb = strb.length() ; lenc = strc.length() ;
	
	int found =0 , j=0 , k=0 ;
	
	if((lena + lenb) == lenc)
	{
		int a,b,c ;
		for(int i =0 ; i&#060;lenc ; i++)	
		{
			found = 0 ;
			if(j&#060;lena &#038;&#038; found ==0)
			if(strc[i] == stra[j])
			{
				j++ ;
				found = 1;
			}
			
			if(k&#060;lenb  &#038;&#038; found ==0)
			if( strc[i] == strb[k] )
			{
				k++;
				found = 1;
			}
			
			if(found == 0)
			{
			cout&#060;&#060;&#034;not interlieved&#034;&#060;&#060;endl;
			break ;
			
			}
		}	
		if(found == 1)
		cout&#060;&#060;&#034;interlieved&#034;&#060;&#060;endl;
	}
	else
	{
	cout&#060;&#060;&#034;not interlieved&#034;&#060;&#060;endl;
	}

}]]></description>
			<content:encoded><![CDATA[<p>#include</p>
<p>using namespace std ;</p>
<p>int main()<br />
{<br />
	string stra , strb , strc ;<br />
	cin&gt;&gt;stra&gt;&gt;strb&gt;&gt;strc ;</p>
<p>	int lena , lenb , lenc ;<br />
	lena = stra.length(); lenb = strb.length() ; lenc = strc.length() ;</p>
<p>	int found =0 , j=0 , k=0 ;</p>
<p>	if((lena + lenb) == lenc)<br />
	{<br />
		int a,b,c ;<br />
		for(int i =0 ; i&lt;lenc ; i++)<br />
		{<br />
			found = 0 ;<br />
			if(j&lt;lena &amp;&amp; found ==0)<br />
			if(strc[i] == stra[j])<br />
			{<br />
				j++ ;<br />
				found = 1;<br />
			}</p>
<p>			if(k&lt;lenb  &amp;&amp; found ==0)<br />
			if( strc[i] == strb[k] )<br />
			{<br />
				k++;<br />
				found = 1;<br />
			}</p>
<p>			if(found == 0)<br />
			{<br />
			cout&lt;&lt;&quot;not interlieved&quot;&lt;&lt;endl;<br />
			break ;</p>
<p>			}<br />
		}<br />
		if(found == 1)<br />
		cout&lt;&lt;&quot;interlieved&quot;&lt;&lt;endl;<br />
	}<br />
	else<br />
	{<br />
	cout&lt;&lt;&quot;not interlieved&quot;&lt;&lt;endl;<br />
	}</p>
<p>}</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
