<?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: Shubham Kumar</title>
    <description>The latest articles on DEV Community by Shubham Kumar (@shubham_kumar_0055).</description>
    <link>https://dev.to/shubham_kumar_0055</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.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1999335%2F723cd745-4d0a-4141-92a1-8a74dbab7b4b.jpg</url>
      <title>DEV Community: Shubham Kumar</title>
      <link>https://dev.to/shubham_kumar_0055</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/shubham_kumar_0055"/>
    <language>en</language>
    <item>
      <title>Recursion</title>
      <dc:creator>Shubham Kumar</dc:creator>
      <pubDate>Fri, 30 Aug 2024 12:12:15 +0000</pubDate>
      <link>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-3hc</link>
      <guid>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-3hc</guid>
      <description>&lt;h2&gt;
  
  
  What is recursion
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Recursion&lt;/strong&gt; is the process of a function calling itself repeatedly till the given condition is satisfied. A function that calls itself directly or indirectly is called a recursive function and such kind of function calls are called recursive calls.&lt;/p&gt;

&lt;p&gt;In computing, recursion provides powerful alternative for performing  repetitive tasks. In fact, few programming languages do not explicitly support looping constructs  instead rely on recursion.&lt;/p&gt;

&lt;p&gt;In depth recursion means when you call a  function by its name for the time then the function call its name inside its definition to perform repetitive task similar as loop until the condition is true, for using recursion we should know the starting and end point of the task or operation.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" alt="Image description" width="800" height="549"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Recursive Functions in C&lt;/strong&gt;&lt;br&gt;
In C, a function that calls itself is called Recursive Function. The recursive functions contain a call to themselves somewhere in the function body. Moreover, a functions can contain multiple recursive calls.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Syntax&lt;/strong&gt;&lt;br&gt;
type function_name (args) {&lt;br&gt;
    // function statements&lt;br&gt;
    // base condition&lt;br&gt;
    // recursion case (recursive call)&lt;br&gt;
}&lt;/p&gt;

&lt;p&gt;this is the basic syntax  to perform recursion in function. &lt;/p&gt;

&lt;p&gt;Recursion is an important topic in the study of data structure and algorithm &lt;/p&gt;

</description>
    </item>
    <item>
      <title>Recursion and its advantages</title>
      <dc:creator>Shubham Kumar</dc:creator>
      <pubDate>Fri, 30 Aug 2024 12:12:15 +0000</pubDate>
      <link>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-4hoi</link>
      <guid>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-4hoi</guid>
      <description>&lt;h2&gt;
  
  
  What is recursion
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Recursion&lt;/strong&gt; is the process of a function calling itself repeatedly till the given condition is satisfied. A function that calls itself directly or indirectly is called a recursive function and such kind of function calls are called recursive calls.&lt;/p&gt;

&lt;p&gt;In computing, recursion provides powerful alternative for performing  repetitive tasks. In fact, few programming languages do not explicitly support looping constructs  instead rely on recursion.&lt;/p&gt;

&lt;p&gt;In depth recursion means when you call a  function by its name for the time then the function call its name inside its definition to perform repetitive task similar as loop until the condition is true, for using recursion we should know the starting and end point of the task or operation.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" alt="Image description" width="800" height="549"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Recursive Functions in C&lt;/strong&gt;&lt;br&gt;
In C, a function that calls itself is called Recursive Function. The recursive functions contain a call to themselves somewhere in the function body. Moreover, a functions can contain multiple recursive calls.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Syntax&lt;/strong&gt;&lt;br&gt;
type function_name (args) {&lt;br&gt;
    // function statements&lt;br&gt;
    // base condition&lt;br&gt;
    // recursion case (recursive call)&lt;br&gt;
}&lt;/p&gt;

&lt;p&gt;this is the basic syntax  to perform recursion in function. &lt;/p&gt;

&lt;p&gt;Recursion is an important topic in the study of data structure and algorithm &lt;/p&gt;

</description>
    </item>
    <item>
      <title>Recursion and its advantages</title>
      <dc:creator>Shubham Kumar</dc:creator>
      <pubDate>Fri, 30 Aug 2024 12:12:15 +0000</pubDate>
      <link>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-hgk</link>
      <guid>https://dev.to/shubham_kumar_0055/recursion-and-its-advantages-hgk</guid>
      <description>&lt;h2&gt;
  
  
  What is recursion
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Recursion&lt;/strong&gt; is the process of a function calling itself repeatedly till the given condition is satisfied. A function that calls itself directly or indirectly is called a recursive function and such kind of function calls are called recursive calls.&lt;/p&gt;

&lt;p&gt;In computing, recursion provides powerful alternative for performing  repetitive tasks. In fact, few programming languages do not explicitly support looping constructs  instead rely on recursion.&lt;/p&gt;

&lt;p&gt;In depth recursion means when you call a  function by its name for the time then the function call its name inside its definition to perform repetitive task similar as loop until the condition is true, for using recursion we should know the starting and end point of the task or operation.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3jirn6u2qctd1loeoil.jpg" alt="Image description" width="800" height="549"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Recursive Functions in C&lt;/strong&gt;&lt;br&gt;
In C, a function that calls itself is called Recursive Function. The recursive functions contain a call to themselves somewhere in the function body. Moreover, a functions can contain multiple recursive calls.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Syntax&lt;/strong&gt;&lt;br&gt;
type function_name (args) {&lt;br&gt;
    // function statements&lt;br&gt;
    // base condition&lt;br&gt;
    // recursion case (recursive call)&lt;br&gt;
}&lt;/p&gt;

&lt;p&gt;this is the basic syntax  to perform recursion in function. &lt;/p&gt;

&lt;p&gt;Recursion is an important topic in the study of data structure and algorithm &lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
