<?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>Algorithmics Basics &#8211; codevember.org</title>
	<atom:link href="https://codevember.org/tag/algo-basics/feed/" rel="self" type="application/rss+xml" />
	<link>https://codevember.org</link>
	<description>Code for fun</description>
	<lastBuildDate>Mon, 18 Oct 2021 13:36:23 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9</generator>
	<item>
		<title>Recipe: How To Translate A Recursive Function Into An Implicite One</title>
		<link>https://codevember.org/recursive-to-implicite/</link>
					<comments>https://codevember.org/recursive-to-implicite/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Mon, 18 Oct 2021 11:38:31 +0000</pubDate>
				<category><![CDATA[Algorithmics]]></category>
		<category><![CDATA[Applied Mathematics]]></category>
		<category><![CDATA[Theory In Computer Science]]></category>
		<category><![CDATA[Algorithmics Basics]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[implicite]]></category>
		<category><![CDATA[recursive]]></category>
		<guid isPermaLink="false">http://codevember.org/?p=467</guid>

					<description><![CDATA[In order to determine the runtime of a recursive function, it is helpful to translate this function into an implicite one. This blog post illustrates a straight-forward approach, intuitively &#8211; with exactly 5 steps on a small example. This approach is also applicable for almost every recursive function. Why Tho? The reason to resolve a [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/recursive-to-implicite/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>A Few Words On Algorithm Complexity</title>
		<link>https://codevember.org/a-few-words-on-algorithm-complexity/</link>
					<comments>https://codevember.org/a-few-words-on-algorithm-complexity/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Sat, 24 Oct 2020 22:34:36 +0000</pubDate>
				<category><![CDATA[Algorithmics]]></category>
		<category><![CDATA[Theory In Computer Science]]></category>
		<category><![CDATA[Algorithmics Basics]]></category>
		<guid isPermaLink="false">http://codevember.org/?p=424</guid>

					<description><![CDATA[One of the key properties of a given algorithm is its complexity. A computer scientist is interested in the adequacy of the algorithm runtime relative to the size of the input. While there exist sharp runtime lower bounds for any given algorithm, for upper bounds however, the sky is the limit. It depends on the [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/a-few-words-on-algorithm-complexity/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
