<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>IT&#38;C Solutions &#187; Lista simpla</title>
	<atom:link href="http://www.itcsolutions.eu/tag/lista-simpla/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.itcsolutions.eu</link>
	<description>Solutions and tutorials for IT&#38;C development</description>
	<lastBuildDate>Sun, 16 Oct 2011 21:22:35 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List</title>
		<link>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/</link>
		<comments>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/#comments</comments>
		<pubDate>Mon, 02 Nov 2009 18:46:56 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Lista simpla]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=751</guid>
		<description><![CDATA[The storage structures for sparse matrixes are presented at [...]. The simply linked list is a linear data structure, formed by elements called nodes. A node is composed by two categories of fields: The field with the information necessary for processing; The field with the information for connecting with the successor node in the simply [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/11/02/how-to-use-simply-linked-lists-for-implementing-the-sparse-matrix-data-structure-in-c-programming-language/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Implementarea structurii de date Matrice Rara in C++ utilizand lista simplu inlantuita</title>
		<link>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/</link>
		<comments>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/#comments</comments>
		<pubDate>Sat, 31 Oct 2009 10:56:53 +0000</pubDate>
		<dc:creator>Marius</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Date]]></category>
		<category><![CDATA[Lista simpla]]></category>
		<category><![CDATA[Matrice rara]]></category>
		<category><![CDATA[Structura]]></category>

		<guid isPermaLink="false">http://www.itcsolutions.eu/?p=718</guid>
		<description><![CDATA[Structurile de stocare a matricelor rare sunt prezentate la [...]. Lista simpla este o structura de date liniara, formata din elemente denumite noduri. Un nod este compus din doua categorii de campuri: Campul cu informatia necesara prelucrarii; Campul cu informatia de legatura cu nodul succesor in cadrul structurii de tip lista simpla; se defineste sub [...]]]></description>
		<wfw:commentRss>http://www.itcsolutions.eu/2009/10/31/utilizarea-listelor-simple-pentru-implementarea-structurii-de-date-matrice-rara-in-limbajul-de-programare-c/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

