<?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>http://www.alper.net/ &#187; C/C++</title>
	<atom:link href="http://www.alper.net/category/programming/cc/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.alper.net</link>
	<description>Eyup Alper Yoney</description>
	<lastBuildDate>Mon, 27 Jun 2011 07:48:21 +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>Endianness</title>
		<link>http://www.alper.net/programming/endianness/</link>
		<comments>http://www.alper.net/programming/endianness/#comments</comments>
		<pubDate>Tue, 12 Jan 2010 08:25:02 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Endianness]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=318</guid>
		<description><![CDATA[I found a paper about endianness while I was looking on Intel's developer documentations. I have been wondering what kind of advantages can be gained to store the data in little endian or big endian format. There are some explained advantages and disadvantages in that document. However, I haven't been enough convinced with these explanations. [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/endianness/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>C++, Functions That Return Two Values</title>
		<link>http://www.alper.net/programming/c-functions-that-return-two-values/</link>
		<comments>http://www.alper.net/programming/c-functions-that-return-two-values/#comments</comments>
		<pubDate>Sat, 02 Jan 2010 08:06:13 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[STL]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=262</guid>
		<description><![CDATA[I am going to explain the class pair that is provided to treat two values as one. The class pair is used several times in STL. The container classes map and multimap use the class pair to handle the key/value pairs. The other usage of the pair class is functions that return two values. I [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/c-functions-that-return-two-values/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Peterson&#8217;s n-Process Protocol</title>
		<link>http://www.alper.net/programming/petersons-n-process-protocol/</link>
		<comments>http://www.alper.net/programming/petersons-n-process-protocol/#comments</comments>
		<pubDate>Sat, 19 Dec 2009 12:53:36 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Peterson's Solution]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=171</guid>
		<description><![CDATA[Peterson's Solution is a classic software based solution to the critical-section problem. Peterson's original formulations works for 2 processes. However, it is possible to implement it for more than 2 processes. The following code works for 2 processes and it can be found easily on the Internet. #define FALSE &#160;0 #define TRUE &#160; 1 int [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/petersons-n-process-protocol/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Nice Try :)</title>
		<link>http://www.alper.net/others/nice-try/</link>
		<comments>http://www.alper.net/others/nice-try/#comments</comments>
		<pubDate>Thu, 03 Dec 2009 18:13:46 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Others]]></category>
		<category><![CDATA[Caricature]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=149</guid>
		<description><![CDATA[]]></description>
		<wfw:commentRss>http://www.alper.net/others/nice-try/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Tower of Hanoi</title>
		<link>http://www.alper.net/programming/tower-of-hanoi/</link>
		<comments>http://www.alper.net/programming/tower-of-hanoi/#comments</comments>
		<pubDate>Sun, 16 Mar 2008 15:24:31 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Hanoi]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[Tower of Hanoi]]></category>

		<guid isPermaLink="false">http://www.alper.net/programming/tower-of-hanoi/</guid>
		<description><![CDATA[The tower of Hanoi is a mathematical game invented by French mathematician Edouard Lucas in 1883. We are given a tower of eight disks, initially stacked in decreasing size on one of three pegs. The objective is to transfer entire tower A to the peg B, moving only one disk at a time and never [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/tower-of-hanoi/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

