<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: shanthi1910</title>
    <description>The latest articles on DEV Community by shanthi1910 (@shanthi1910).</description>
    <link>https://dev.to/shanthi1910</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F626521%2F4bbd0a13-6f0c-4f38-8038-40ede746bcdc.png</url>
      <title>DEV Community: shanthi1910</title>
      <link>https://dev.to/shanthi1910</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/shanthi1910"/>
    <language>en</language>
    <item>
      <title>Dynamic programming</title>
      <dc:creator>shanthi1910</dc:creator>
      <pubDate>Thu, 21 Oct 2021 12:12:26 +0000</pubDate>
      <link>https://dev.to/shanthi1910/dynamic-programming-2o25</link>
      <guid>https://dev.to/shanthi1910/dynamic-programming-2o25</guid>
      <description>&lt;p&gt;Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of subproblems, so that we do not have to re-compute them when needed later. This simple optimization reduces time complexities from exponential to polynomial. For example, if we write simple recursive solution for Fibonacci Numbers, we get exponential time complexity and if we optimize it by storing solutions of subproblems, time complexity reduces to linear.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--AnvNMBvQ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/gvjh7tanio41iloxsyx4.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--AnvNMBvQ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/gvjh7tanio41iloxsyx4.png" alt="Image description"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Advantage of dynamic programming:&lt;br&gt;
The advantage of dynamic programming is that it can obtain both local and total optimal solution. Also, practical knowledge can be used to gain the higher efficiency of dynamic programming. However, there is no unifiedstandard model for dynamic programming, multiple condition may appear during the solving process.&lt;/p&gt;

&lt;p&gt;disadvantage of dynamic programming:&lt;br&gt;
It takes a lot of memory to store the calculated result of every subproblem without ensuring if the stored value will be utilized or not. Many times, output value gets stored and never gets utilized in the next subproblems while execution.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>what is hamiltonian?</title>
      <dc:creator>shanthi1910</dc:creator>
      <pubDate>Thu, 06 May 2021 10:38:53 +0000</pubDate>
      <link>https://dev.to/shanthi1910/what-is-hamiltonian-2f57</link>
      <guid>https://dev.to/shanthi1910/what-is-hamiltonian-2f57</guid>
      <description>&lt;p&gt;what is hamiltonian cycle ?&lt;br&gt;&lt;br&gt;
In a connected graph ,a closed walk that vists every vertex  of the graph G exactly once except the starting and ending vertices .it is called hamiltonian cycle.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s---NQ-TIpt--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/pxoi7yacqp3yyxmae0tn.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s---NQ-TIpt--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/pxoi7yacqp3yyxmae0tn.png" alt="image"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;what is hamiltonian path? &lt;br&gt;
In a connected graph ,an open walk that visits every vertex of the graph G exactly once.but it containan open walk.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--uKAszk0Z--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ztf2h8ukbljz3mxkaxkd.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--uKAszk0Z--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ztf2h8ukbljz3mxkaxkd.png" alt="image"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;what is hamiltonian graph?&lt;br&gt;
A graph G is said to be hamiltonian graph if it contain a hamiltonian cycle. &lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--6iKa-6qe--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hwhq7v3cwb7r22d7qb20.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--6iKa-6qe--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hwhq7v3cwb7r22d7qb20.png" alt="image"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>hamiltonian</category>
    </item>
  </channel>
</rss>
