<?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: Detecting and Breaking a Loop in a Linked List</title>
	<atom:link href="/2012/07/17/computer-algorithms-detecting-and-breaking-a-loop-in-a-linked-list/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/07/17/computer-algorithms-detecting-and-breaking-a-loop-in-a-linked-list/</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: gold account</title>
		<link>/2012/07/17/computer-algorithms-detecting-and-breaking-a-loop-in-a-linked-list/comment-page-1/#comment-16361</link>
		<dc:creator><![CDATA[gold account]]></dc:creator>
		<pubDate>Mon, 23 Jul 2012 22:59:23 +0000</pubDate>
		<guid isPermaLink="false">/?p=3243#comment-16361</guid>
		<description><![CDATA[When working with singly linked list, we are typically given a link to the first node. Common operations on a singly linked list are iterating through all the nodes, adding to the list, or deleting from the list. Algorithms for these operations generally require a well formed linked list. That is a linked list without loops or cycles in it.]]></description>
		<content:encoded><![CDATA[<p>When working with singly linked list, we are typically given a link to the first node. Common operations on a singly linked list are iterating through all the nodes, adding to the list, or deleting from the list. Algorithms for these operations generally require a well formed linked list. That is a linked list without loops or cycles in it.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
