<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>cplusplus.co.il &#187; algorithms</title>
	<atom:link href="http://cplusplus.co.il/category/cpp/algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>http://cplusplus.co.il</link>
	<description>Discussing modern C++ and related topics.</description>
	<lastBuildDate>Tue, 31 Jan 2012 18:28:36 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='cplusplus.co.il' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>cplusplus.co.il &#187; algorithms</title>
		<link>http://cplusplus.co.il</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://cplusplus.co.il/osd.xml" title="cplusplus.co.il" />
	<atom:link rel='hub' href='http://cplusplus.co.il/?pushpress=hub'/>
		<item>
		<title>Project Euler</title>
		<link>http://cplusplus.co.il/2009/12/14/project-euler/</link>
		<comments>http://cplusplus.co.il/2009/12/14/project-euler/#comments</comments>
		<pubDate>Sun, 13 Dec 2009 22:52:29 +0000</pubDate>
		<dc:creator>rmn</dc:creator>
				<category><![CDATA[algorithms]]></category>

		<guid isPermaLink="false">http://cplusplus.co.il/?p=658</guid>
		<description><![CDATA[I know I&#8217;m a little late, but I&#8217;ve only recently discovered the interesting site of projecteuler.net. For anybody not familiar with it, Project Euler is a site offering a vast collection of programming puzzles of mathematical nature for anybody to solve. It has a ranking system for its members, allowing every member to see others&#8217; [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=cplusplus.co.il&amp;blog=8968104&amp;post=658&amp;subd=cpptalk&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://cplusplus.co.il/2009/12/14/project-euler/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/4ceb7c3e96e1e6c9fbef377af219fc0a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">rmn</media:title>
		</media:content>
	</item>
		<item>
		<title>Enumerating permutations</title>
		<link>http://cplusplus.co.il/2009/11/14/enumerating-permutations/</link>
		<comments>http://cplusplus.co.il/2009/11/14/enumerating-permutations/#comments</comments>
		<pubDate>Sat, 14 Nov 2009 09:59:18 +0000</pubDate>
		<dc:creator>rmn</dc:creator>
				<category><![CDATA[algorithms]]></category>

		<guid isPermaLink="false">http://cplusplus.co.il/?p=597</guid>
		<description><![CDATA[There are exactly n! different permutations of n numbers. This challenge was about writing a function which is able to enumerate all these permutations, i.e. function permute(n, idx) which is able to return permutation with index idx of n numbers. The requirement is ofcourse that all these permutations must be unique &#8211; this is in [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=cplusplus.co.il&amp;blog=8968104&amp;post=597&amp;subd=cpptalk&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://cplusplus.co.il/2009/11/14/enumerating-permutations/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/4ceb7c3e96e1e6c9fbef377af219fc0a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">rmn</media:title>
		</media:content>
	</item>
		<item>
		<title>Reset an array in constant time</title>
		<link>http://cplusplus.co.il/2009/11/05/reset-an-array-in-constant-time/</link>
		<comments>http://cplusplus.co.il/2009/11/05/reset-an-array-in-constant-time/#comments</comments>
		<pubDate>Thu, 05 Nov 2009 21:56:26 +0000</pubDate>
		<dc:creator>rmn</dc:creator>
				<category><![CDATA[algorithms]]></category>

		<guid isPermaLink="false">http://cplusplus.co.il/?p=562</guid>
		<description><![CDATA[Ever wondered how to reset an entire array of N elements in a constant slice of time? This post will introduce the algorithm along with an implementation. Let me lay out the problem. There&#8217;s an array of N integers. We would like to be able to reset that array (set all elements to zero), in [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=cplusplus.co.il&amp;blog=8968104&amp;post=562&amp;subd=cpptalk&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://cplusplus.co.il/2009/11/05/reset-an-array-in-constant-time/feed/</wfw:commentRss>
		<slash:comments>12</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/4ceb7c3e96e1e6c9fbef377af219fc0a?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">rmn</media:title>
		</media:content>

		<media:content url="http://cpptalk.files.wordpress.com/2009/11/constant-time-array-reset.png" medium="image">
			<media:title type="html">Constant time reset of an array</media:title>
		</media:content>
	</item>
	</channel>
</rss>
