<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Dynamic-Programming on ZK Punk</title>
		<link>https://www.ZKPunk.dev/tags/dynamic-programming/</link>
		<description>Recent content in Dynamic-Programming on ZK Punk</description>
		<generator>Hugo</generator>
		<language>en</language>
		
		
		
		
			<lastBuildDate>Sat, 07 Jan 2012 00:08:00 -0800</lastBuildDate>
		
			<atom:link href="https://www.ZKPunk.dev/tags/dynamic-programming/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>What is memoization?</title>
				<link>https://www.ZKPunk.dev/posts/what_is_memoization/</link>
				<pubDate>Sat, 07 Jan 2012 00:08:00 -0800</pubDate>
				<guid>https://www.ZKPunk.dev/posts/what_is_memoization/</guid>
				<description>&lt;p&gt;&lt;a href=&#34;https://en.wikipedia.org/wiki/Memoization&#34;&gt;&lt;code&gt;Memoization&lt;/code&gt;&lt;/a&gt; is a computer science concept to optimize programs by avoiding computations that have already been done and to reuse it. This is achieved by storing the computaions in a lookup table and retrieving them if a need for it arrives in a future computation step.&lt;/p&gt;&#xA;&lt;p&gt;Now, lets try to walk this concept using a &lt;a href=&#34;https://en.wikipedia.org/wiki/Fibonacci_number&#34;&gt;&lt;code&gt;Fibonacci series&lt;/code&gt;&lt;/a&gt; where each number in the series is sum of the previous two numbers. In the subsequent code, we are trying to find the value of the N&amp;rsquo;th term in the series.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
